./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4763c2b4c908cc214cd1281e5c0202db2011511 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:12,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:12,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:12,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:12,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:12,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:12,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:12,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:12,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:12,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:12,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:12,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:12,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:12,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:12,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:12,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:12,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:12,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:12,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:12,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:12,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:12,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:12,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:12,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:12,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:12,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:12,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:12,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:12,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:12,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:12,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:12,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:12,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:12,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:12,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:12,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:12,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:12,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:12,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:12,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:12,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:12,133 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:12,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:12,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:12,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:12,145 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:12,145 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:12,146 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:12,146 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:12,146 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:12,146 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:12,146 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:12,147 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:12,147 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:12,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:12,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:12,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:12,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:12,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:12,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:12,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:12,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:12,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:12,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:12,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:12,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:12,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:12,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:12,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:12,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:12,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:12,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:12,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:12,152 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:12,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:12,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:12,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:12,153 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4763c2b4c908cc214cd1281e5c0202db2011511 [2019-10-22 11:23:12,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:12,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:12,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:12,221 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:12,222 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:12,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/../../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2019-10-22 11:23:12,286 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/data/cc87813f4/59adb688a06f48d289a97bb46ccc3a21/FLAG0569efc56 [2019-10-22 11:23:12,788 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:12,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2019-10-22 11:23:12,803 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/data/cc87813f4/59adb688a06f48d289a97bb46ccc3a21/FLAG0569efc56 [2019-10-22 11:23:13,091 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/data/cc87813f4/59adb688a06f48d289a97bb46ccc3a21 [2019-10-22 11:23:13,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:13,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:13,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:13,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:13,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:13,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:13" (1/1) ... [2019-10-22 11:23:13,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d502737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:13, skipping insertion in model container [2019-10-22 11:23:13,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:13" (1/1) ... [2019-10-22 11:23:13,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:13,180 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:13,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:13,887 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:13,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:14,047 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:14,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14 WrapperNode [2019-10-22 11:23:14,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:14,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:14,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:14,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:14,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:14,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:14,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:14,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:14,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,189 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... [2019-10-22 11:23:14,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:14,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:14,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:14,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:14,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:14,308 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-22 11:23:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:14,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-22 11:23:14,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:14,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:15,431 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:15,431 INFO L284 CfgBuilder]: Removed 155 assume(true) statements. [2019-10-22 11:23:15,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:15 BoogieIcfgContainer [2019-10-22 11:23:15,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:15,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:15,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:15,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:15,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:13" (1/3) ... [2019-10-22 11:23:15,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2080e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:15, skipping insertion in model container [2019-10-22 11:23:15,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:14" (2/3) ... [2019-10-22 11:23:15,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2080e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:15, skipping insertion in model container [2019-10-22 11:23:15,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:15" (3/3) ... [2019-10-22 11:23:15,445 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product10.cil.c [2019-10-22 11:23:15,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:15,467 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:23:15,482 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:23:15,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:15,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:15,516 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:15,516 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:15,516 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:15,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:15,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:15,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-10-22 11:23:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:23:15,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:15,550 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:15,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1164700804, now seen corresponding path program 1 times [2019-10-22 11:23:15,572 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:15,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650130538] [2019-10-22 11:23:15,573 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:15,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:15,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650130538] [2019-10-22 11:23:15,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:15,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:15,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851073845] [2019-10-22 11:23:15,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:15,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:15,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:15,972 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 2 states. [2019-10-22 11:23:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,022 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2019-10-22 11:23:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:16,023 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-22 11:23:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,035 INFO L225 Difference]: With dead ends: 273 [2019-10-22 11:23:16,035 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:23:16,038 INFO L600 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 [2019-10-22 11:23:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:23:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-10-22 11:23:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-22 11:23:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 209 transitions. [2019-10-22 11:23:16,087 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 209 transitions. Word has length 32 [2019-10-22 11:23:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,088 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 209 transitions. [2019-10-22 11:23:16,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 209 transitions. [2019-10-22 11:23:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:23:16,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,090 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,090 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash 649551968, now seen corresponding path program 1 times [2019-10-22 11:23:16,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903836667] [2019-10-22 11:23:16,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903836667] [2019-10-22 11:23:16,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:16,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658535483] [2019-10-22 11:23:16,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:16,241 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:16,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,242 INFO L87 Difference]: Start difference. First operand 131 states and 209 transitions. Second operand 3 states. [2019-10-22 11:23:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,348 INFO L93 Difference]: Finished difference Result 366 states and 585 transitions. [2019-10-22 11:23:16,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:16,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-22 11:23:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,352 INFO L225 Difference]: With dead ends: 366 [2019-10-22 11:23:16,352 INFO L226 Difference]: Without dead ends: 246 [2019-10-22 11:23:16,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-22 11:23:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2019-10-22 11:23:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:23:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2019-10-22 11:23:16,380 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 33 [2019-10-22 11:23:16,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,381 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2019-10-22 11:23:16,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2019-10-22 11:23:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 11:23:16,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,383 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1050919469, now seen corresponding path program 1 times [2019-10-22 11:23:16,384 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296273841] [2019-10-22 11:23:16,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,385 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296273841] [2019-10-22 11:23:16,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:16,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647864221] [2019-10-22 11:23:16,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:16,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:16,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,456 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 3 states. [2019-10-22 11:23:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,494 INFO L93 Difference]: Finished difference Result 246 states and 390 transitions. [2019-10-22 11:23:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:16,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-22 11:23:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,496 INFO L225 Difference]: With dead ends: 246 [2019-10-22 11:23:16,497 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:23:16,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:23:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-10-22 11:23:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-22 11:23:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2019-10-22 11:23:16,517 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 34 [2019-10-22 11:23:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,518 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 202 transitions. [2019-10-22 11:23:16,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2019-10-22 11:23:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:23:16,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,522 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,523 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1106619438, now seen corresponding path program 1 times [2019-10-22 11:23:16,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491392930] [2019-10-22 11:23:16,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:16,631 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491392930] [2019-10-22 11:23:16,632 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,632 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:16,632 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646304868] [2019-10-22 11:23:16,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:16,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,633 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. Second operand 3 states. [2019-10-22 11:23:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:16,661 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2019-10-22 11:23:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:16,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:23:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:16,664 INFO L225 Difference]: With dead ends: 213 [2019-10-22 11:23:16,664 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 11:23:16,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 11:23:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-10-22 11:23:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-10-22 11:23:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 204 transitions. [2019-10-22 11:23:16,685 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 204 transitions. Word has length 36 [2019-10-22 11:23:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:16,686 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 204 transitions. [2019-10-22 11:23:16,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 204 transitions. [2019-10-22 11:23:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 11:23:16,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:16,691 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:16,691 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 646998941, now seen corresponding path program 1 times [2019-10-22 11:23:16,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:16,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991731594] [2019-10-22 11:23:16,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:16,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991731594] [2019-10-22 11:23:16,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:16,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:23:16,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91904524] [2019-10-22 11:23:16,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:23:16,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:23:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:16,854 INFO L87 Difference]: Start difference. First operand 132 states and 204 transitions. Second operand 10 states. [2019-10-22 11:23:17,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:17,706 INFO L93 Difference]: Finished difference Result 635 states and 911 transitions. [2019-10-22 11:23:17,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-22 11:23:17,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-22 11:23:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:17,710 INFO L225 Difference]: With dead ends: 635 [2019-10-22 11:23:17,710 INFO L226 Difference]: Without dead ends: 577 [2019-10-22 11:23:17,715 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-10-22 11:23:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-22 11:23:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 172. [2019-10-22 11:23:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-22 11:23:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2019-10-22 11:23:17,759 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 41 [2019-10-22 11:23:17,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:17,759 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2019-10-22 11:23:17,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:23:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2019-10-22 11:23:17,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 11:23:17,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:17,761 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:17,761 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:17,761 INFO L82 PathProgramCache]: Analyzing trace with hash 96641044, now seen corresponding path program 1 times [2019-10-22 11:23:17,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:17,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955451169] [2019-10-22 11:23:17,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:17,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:17,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:17,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955451169] [2019-10-22 11:23:17,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:17,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:17,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568157153] [2019-10-22 11:23:17,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:17,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:17,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:17,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:17,878 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand 5 states. [2019-10-22 11:23:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,004 INFO L93 Difference]: Finished difference Result 607 states and 921 transitions. [2019-10-22 11:23:18,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:18,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-22 11:23:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,007 INFO L225 Difference]: With dead ends: 607 [2019-10-22 11:23:18,007 INFO L226 Difference]: Without dead ends: 512 [2019-10-22 11:23:18,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-22 11:23:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 318. [2019-10-22 11:23:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-22 11:23:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 495 transitions. [2019-10-22 11:23:18,037 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 495 transitions. Word has length 42 [2019-10-22 11:23:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,037 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 495 transitions. [2019-10-22 11:23:18,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 495 transitions. [2019-10-22 11:23:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-22 11:23:18,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,039 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:18,039 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1419304017, now seen corresponding path program 1 times [2019-10-22 11:23:18,040 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391286544] [2019-10-22 11:23:18,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:18,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391286544] [2019-10-22 11:23:18,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:18,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:18,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795467241] [2019-10-22 11:23:18,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:18,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:18,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:18,131 INFO L87 Difference]: Start difference. First operand 318 states and 495 transitions. Second operand 5 states. [2019-10-22 11:23:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:18,292 INFO L93 Difference]: Finished difference Result 905 states and 1328 transitions. [2019-10-22 11:23:18,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:18,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-22 11:23:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:18,296 INFO L225 Difference]: With dead ends: 905 [2019-10-22 11:23:18,297 INFO L226 Difference]: Without dead ends: 704 [2019-10-22 11:23:18,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:18,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-10-22 11:23:18,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 330. [2019-10-22 11:23:18,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-22 11:23:18,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 507 transitions. [2019-10-22 11:23:18,333 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 507 transitions. Word has length 42 [2019-10-22 11:23:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:18,333 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 507 transitions. [2019-10-22 11:23:18,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:18,334 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 507 transitions. [2019-10-22 11:23:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:23:18,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:18,335 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:18,335 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:18,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 358561176, now seen corresponding path program 1 times [2019-10-22 11:23:18,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:18,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211337867] [2019-10-22 11:23:18,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:18,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:18,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211337867] [2019-10-22 11:23:18,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:18,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:23:18,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190649105] [2019-10-22 11:23:18,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:23:18,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:18,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:23:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:23:18,439 INFO L87 Difference]: Start difference. First operand 330 states and 507 transitions. Second operand 9 states. [2019-10-22 11:23:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:19,232 INFO L93 Difference]: Finished difference Result 1536 states and 2203 transitions. [2019-10-22 11:23:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-22 11:23:19,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-10-22 11:23:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:19,238 INFO L225 Difference]: With dead ends: 1536 [2019-10-22 11:23:19,238 INFO L226 Difference]: Without dead ends: 1316 [2019-10-22 11:23:19,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:23:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-10-22 11:23:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 476. [2019-10-22 11:23:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-22 11:23:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 719 transitions. [2019-10-22 11:23:19,291 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 719 transitions. Word has length 43 [2019-10-22 11:23:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:19,291 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 719 transitions. [2019-10-22 11:23:19,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:23:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 719 transitions. [2019-10-22 11:23:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:23:19,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:19,292 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:19,292 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -263872284, now seen corresponding path program 1 times [2019-10-22 11:23:19,293 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:19,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327212617] [2019-10-22 11:23:19,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:19,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327212617] [2019-10-22 11:23:19,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:19,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:23:19,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015140810] [2019-10-22 11:23:19,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:19,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:19,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:19,387 INFO L87 Difference]: Start difference. First operand 476 states and 719 transitions. Second operand 6 states. [2019-10-22 11:23:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:19,532 INFO L93 Difference]: Finished difference Result 900 states and 1331 transitions. [2019-10-22 11:23:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:23:19,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-10-22 11:23:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:19,535 INFO L225 Difference]: With dead ends: 900 [2019-10-22 11:23:19,535 INFO L226 Difference]: Without dead ends: 515 [2019-10-22 11:23:19,536 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:23:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-22 11:23:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 476. [2019-10-22 11:23:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-22 11:23:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 713 transitions. [2019-10-22 11:23:19,593 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 713 transitions. Word has length 43 [2019-10-22 11:23:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:19,594 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 713 transitions. [2019-10-22 11:23:19,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 713 transitions. [2019-10-22 11:23:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-22 11:23:19,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:19,600 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:19,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:19,601 INFO L82 PathProgramCache]: Analyzing trace with hash -5706846, now seen corresponding path program 1 times [2019-10-22 11:23:19,603 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:19,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451597471] [2019-10-22 11:23:19,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:19,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451597471] [2019-10-22 11:23:19,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:19,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:19,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109339981] [2019-10-22 11:23:19,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:19,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:19,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:19,714 INFO L87 Difference]: Start difference. First operand 476 states and 713 transitions. Second operand 5 states. [2019-10-22 11:23:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:19,907 INFO L93 Difference]: Finished difference Result 926 states and 1347 transitions. [2019-10-22 11:23:19,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:19,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-10-22 11:23:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:19,911 INFO L225 Difference]: With dead ends: 926 [2019-10-22 11:23:19,912 INFO L226 Difference]: Without dead ends: 619 [2019-10-22 11:23:19,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-22 11:23:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 478. [2019-10-22 11:23:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-10-22 11:23:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 712 transitions. [2019-10-22 11:23:19,962 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 712 transitions. Word has length 43 [2019-10-22 11:23:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:19,964 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 712 transitions. [2019-10-22 11:23:19,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:19,964 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 712 transitions. [2019-10-22 11:23:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:23:19,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:19,965 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:19,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:19,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:19,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1910056575, now seen corresponding path program 1 times [2019-10-22 11:23:19,966 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:19,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007857741] [2019-10-22 11:23:19,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:19,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:20,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007857741] [2019-10-22 11:23:20,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:20,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:20,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538359077] [2019-10-22 11:23:20,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:20,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:20,023 INFO L87 Difference]: Start difference. First operand 478 states and 712 transitions. Second operand 4 states. [2019-10-22 11:23:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:20,091 INFO L93 Difference]: Finished difference Result 712 states and 1038 transitions. [2019-10-22 11:23:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:20,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-22 11:23:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:20,094 INFO L225 Difference]: With dead ends: 712 [2019-10-22 11:23:20,094 INFO L226 Difference]: Without dead ends: 473 [2019-10-22 11:23:20,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-22 11:23:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 342. [2019-10-22 11:23:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-10-22 11:23:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 508 transitions. [2019-10-22 11:23:20,129 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 508 transitions. Word has length 44 [2019-10-22 11:23:20,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:20,129 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 508 transitions. [2019-10-22 11:23:20,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 508 transitions. [2019-10-22 11:23:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:23:20,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:20,131 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:20,131 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:20,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash 874589663, now seen corresponding path program 1 times [2019-10-22 11:23:20,131 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:20,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497318077] [2019-10-22 11:23:20,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:20,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:20,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:20,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497318077] [2019-10-22 11:23:20,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:20,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:23:20,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797774059] [2019-10-22 11:23:20,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:23:20,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:20,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:23:20,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:23:20,200 INFO L87 Difference]: Start difference. First operand 342 states and 508 transitions. Second operand 5 states. [2019-10-22 11:23:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:20,388 INFO L93 Difference]: Finished difference Result 854 states and 1222 transitions. [2019-10-22 11:23:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:23:20,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:23:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:20,391 INFO L225 Difference]: With dead ends: 854 [2019-10-22 11:23:20,392 INFO L226 Difference]: Without dead ends: 651 [2019-10-22 11:23:20,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:23:20,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-22 11:23:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 340. [2019-10-22 11:23:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-22 11:23:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 502 transitions. [2019-10-22 11:23:20,429 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 502 transitions. Word has length 45 [2019-10-22 11:23:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:20,429 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 502 transitions. [2019-10-22 11:23:20,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:23:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 502 transitions. [2019-10-22 11:23:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:23:20,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:20,431 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:20,432 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:20,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash 931847965, now seen corresponding path program 1 times [2019-10-22 11:23:20,432 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:20,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102952687] [2019-10-22 11:23:20,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:20,433 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:20,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:23:20,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102952687] [2019-10-22 11:23:20,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:20,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:23:20,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680202624] [2019-10-22 11:23:20,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:23:20,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:23:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:20,514 INFO L87 Difference]: Start difference. First operand 340 states and 502 transitions. Second operand 7 states. [2019-10-22 11:23:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:21,013 INFO L93 Difference]: Finished difference Result 1069 states and 1503 transitions. [2019-10-22 11:23:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:23:21,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-10-22 11:23:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:21,015 INFO L225 Difference]: With dead ends: 1069 [2019-10-22 11:23:21,015 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:23:21,016 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-10-22 11:23:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:23:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:23:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:23:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:23:21,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-10-22 11:23:21,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:21,017 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:23:21,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:23:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:23:21,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:23:21,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:23:21,223 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 111 [2019-10-22 11:23:21,834 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-10-22 11:23:22,247 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 195 [2019-10-22 11:23:22,642 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-10-22 11:23:23,031 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 166 [2019-10-22 11:23:23,168 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-10-22 11:23:23,667 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-10-22 11:23:23,980 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 189 [2019-10-22 11:23:24,210 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 143 [2019-10-22 11:23:25,193 WARN L191 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 337 [2019-10-22 11:23:25,307 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 148 [2019-10-22 11:23:25,529 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-10-22 11:23:25,706 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 148 [2019-10-22 11:23:26,258 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-10-22 11:23:26,422 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-10-22 11:23:26,976 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-10-22 11:23:27,691 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 32 [2019-10-22 11:23:28,337 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-10-22 11:23:28,918 WARN L191 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 30 [2019-10-22 11:23:29,205 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 31 [2019-10-22 11:23:29,481 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-10-22 11:23:29,714 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-10-22 11:23:29,826 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-10-22 11:23:30,307 WARN L191 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-10-22 11:23:30,828 WARN L191 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 31 [2019-10-22 11:23:30,939 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 30 [2019-10-22 11:23:31,353 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 19 [2019-10-22 11:23:33,049 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 331 DAG size of output: 36 [2019-10-22 11:23:33,356 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 24 [2019-10-22 11:23:33,866 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-10-22 11:23:33,998 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-10-22 11:23:34,226 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-10-22 11:23:34,550 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 24 [2019-10-22 11:23:34,782 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-10-22 11:23:35,097 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-10-22 11:23:35,271 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2019-10-22 11:23:35,285 INFO L443 ceAbstractionStarter]: For program point L1026-1(lines 1026 1042) no Hoare annotation was computed. [2019-10-22 11:23:35,285 INFO L443 ceAbstractionStarter]: For program point L1919(lines 1919 1923) no Hoare annotation was computed. [2019-10-22 11:23:35,285 INFO L443 ceAbstractionStarter]: For program point L1886(lines 1886 1890) no Hoare annotation was computed. [2019-10-22 11:23:35,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2349) no Hoare annotation was computed. [2019-10-22 11:23:35,288 INFO L439 ceAbstractionStarter]: At program point L1820(lines 1810 1947) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,288 INFO L439 ceAbstractionStarter]: At program point L2580(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:35,288 INFO L443 ceAbstractionStarter]: For program point L2349-1(line 2349) no Hoare annotation was computed. [2019-10-22 11:23:35,288 INFO L443 ceAbstractionStarter]: For program point L2349(line 2349) no Hoare annotation was computed. [2019-10-22 11:23:35,289 INFO L439 ceAbstractionStarter]: At program point L1722(lines 1717 1725) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2019-10-22 11:23:35,289 INFO L443 ceAbstractionStarter]: For program point L1491(lines 1491 1495) no Hoare annotation was computed. [2019-10-22 11:23:35,289 INFO L439 ceAbstractionStarter]: At program point L1491-2(lines 1 2591) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,289 INFO L439 ceAbstractionStarter]: At program point L2350(lines 2326 2343) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= ~__ste_email_to0~0 2) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,289 INFO L446 ceAbstractionStarter]: At program point L2350-1(lines 2326 2343) the Hoare annotation is: true [2019-10-22 11:23:35,289 INFO L439 ceAbstractionStarter]: At program point L2450(lines 2430 2452) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,289 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L138-2(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1041) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L138-4(lines 138 146) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1030 1041) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L439 ceAbstractionStarter]: At program point L1856(lines 1846 1944) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1477) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L1461-1(lines 1461 1477) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point L1825(lines 1825 1832) no Hoare annotation was computed. [2019-10-22 11:23:35,290 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2349) no Hoare annotation was computed. [2019-10-22 11:23:35,291 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:23:35,291 INFO L439 ceAbstractionStarter]: At program point L141-2(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,291 INFO L443 ceAbstractionStarter]: For program point L141-3(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L439 ceAbstractionStarter]: At program point L141-5(lines 134 149) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L141-6(lines 141 145) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L439 ceAbstractionStarter]: At program point L1925(lines 1915 1938) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,293 INFO L439 ceAbstractionStarter]: At program point L141-8(lines 134 149) the Hoare annotation is: (let ((.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~__ste_email_to0~0 2)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= ~rjh~0 2))) (or (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (and (and .cse0 (and (and .cse6 .cse3 .cse1 .cse4) .cse2)) .cse5) (and .cse6 (and (= 1 ULTIMATE.start_outgoing_~msg) .cse0 (and (= 0 ~__ste_client_autoResponse1~0) .cse1)) .cse3 .cse4))) [2019-10-22 11:23:35,293 INFO L439 ceAbstractionStarter]: At program point L1892(lines 1882 1941) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,293 INFO L439 ceAbstractionStarter]: At program point L2553(lines 2542 2556) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L175-4(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L1034(lines 1034 1040) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L1034-1(lines 1034 1040) no Hoare annotation was computed. [2019-10-22 11:23:35,293 INFO L443 ceAbstractionStarter]: For program point L175-6(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:23:35,294 INFO L443 ceAbstractionStarter]: For program point L175-8(lines 175 183) no Hoare annotation was computed. [2019-10-22 11:23:35,294 INFO L446 ceAbstractionStarter]: At program point L2521-1(lines 2496 2523) the Hoare annotation is: true [2019-10-22 11:23:35,294 INFO L439 ceAbstractionStarter]: At program point L2521(lines 2496 2523) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,294 INFO L443 ceAbstractionStarter]: For program point L1861(lines 1861 1865) no Hoare annotation was computed. [2019-10-22 11:23:35,294 INFO L443 ceAbstractionStarter]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2019-10-22 11:23:35,294 INFO L439 ceAbstractionStarter]: At program point L2588(lines 2583 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:35,294 INFO L439 ceAbstractionStarter]: At program point L1630-1(lines 1622 1639) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse5 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse0 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse4 (= ~rjh~0 2))) (or (and .cse0 (and (= ~__ste_email_to0~0 2) (and .cse1 .cse2) .cse3 .cse4) .cse5 .cse6 .cse7) (and .cse2 .cse1 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5 .cse6 .cse0 .cse3 .cse7 .cse4))) [2019-10-22 11:23:35,294 INFO L443 ceAbstractionStarter]: For program point L1630-2(lines 1630 1636) no Hoare annotation was computed. [2019-10-22 11:23:35,294 INFO L446 ceAbstractionStarter]: At program point L1630-3(lines 1622 1639) the Hoare annotation is: true [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L1465(lines 1465 1476) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L1465-1(lines 1465 1476) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L1532(lines 1532 1544) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L1532-2(lines 1532 1544) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L1532-4(lines 1532 1544) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:23:35,295 INFO L439 ceAbstractionStarter]: At program point L178-2(lines 171 186) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,295 INFO L443 ceAbstractionStarter]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:23:35,296 INFO L439 ceAbstractionStarter]: At program point L178-5(lines 171 186) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse0 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13))) (.cse1 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse7 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse8 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse6 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ~rjh~0 2))) (or (and .cse0 .cse1 (and (and (= ~__ste_email_to0~0 2) (and .cse2 .cse3) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9)) (and .cse3 .cse2 .cse0 .cse1 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse7 .cse8 .cse6 .cse4 .cse9 .cse5))) [2019-10-22 11:23:35,296 INFO L443 ceAbstractionStarter]: For program point L178-6(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:23:35,296 INFO L439 ceAbstractionStarter]: At program point L178-8(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,296 INFO L443 ceAbstractionStarter]: For program point L178-9(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:23:35,296 INFO L446 ceAbstractionStarter]: At program point L178-11(lines 171 186) the Hoare annotation is: true [2019-10-22 11:23:35,296 INFO L443 ceAbstractionStarter]: For program point L178-12(lines 178 182) no Hoare annotation was computed. [2019-10-22 11:23:35,296 INFO L446 ceAbstractionStarter]: At program point L178-14(lines 171 186) the Hoare annotation is: true [2019-10-22 11:23:35,296 INFO L443 ceAbstractionStarter]: For program point L1930(lines 1930 1934) no Hoare annotation was computed. [2019-10-22 11:23:35,296 INFO L443 ceAbstractionStarter]: For program point L1897(lines 1897 1901) no Hoare annotation was computed. [2019-10-22 11:23:35,297 INFO L439 ceAbstractionStarter]: At program point L1930-1(lines 1802 1948) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,297 INFO L439 ceAbstractionStarter]: At program point L1039(lines 1022 1045) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,297 INFO L439 ceAbstractionStarter]: At program point L1039-1(lines 1022 1045) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3))) (or (and (= 0 ~__ste_client_autoResponse1~0) .cse0 (not (= ~rjh~0 1)) (= 0 |ULTIMATE.start_getClientAutoResponse_#res|) (not (= 1 ULTIMATE.start_createEmail_~to))) (and (and (= |ULTIMATE.start_createEmail_#res| 1) (and (= 2 ULTIMATE.start_createEmail_~to) (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) .cse0) (= ~rjh~0 2))) (= 1 ULTIMATE.start_createEmail_~msg~0)))) [2019-10-22 11:23:35,297 INFO L443 ceAbstractionStarter]: For program point L1535(lines 1535 1543) no Hoare annotation was computed. [2019-10-22 11:23:35,297 INFO L443 ceAbstractionStarter]: For program point L1535-2(lines 1535 1543) no Hoare annotation was computed. [2019-10-22 11:23:35,297 INFO L443 ceAbstractionStarter]: For program point L1469(lines 1469 1475) no Hoare annotation was computed. [2019-10-22 11:23:35,297 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 1469 1475) no Hoare annotation was computed. [2019-10-22 11:23:35,297 INFO L443 ceAbstractionStarter]: For program point L1535-4(lines 1535 1543) no Hoare annotation was computed. [2019-10-22 11:23:35,298 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-10-22 11:23:35,298 INFO L443 ceAbstractionStarter]: For program point L82-1(lines 82 93) no Hoare annotation was computed. [2019-10-22 11:23:35,298 INFO L439 ceAbstractionStarter]: At program point L1867(lines 1857 1943) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,298 INFO L439 ceAbstractionStarter]: At program point L1834(lines 1821 1946) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,298 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 1542) no Hoare annotation was computed. [2019-10-22 11:23:35,298 INFO L439 ceAbstractionStarter]: At program point L2529-1(lines 2524 2532) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,298 INFO L439 ceAbstractionStarter]: At program point L1538-2(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-10-22 11:23:35,298 INFO L439 ceAbstractionStarter]: At program point L2529(lines 2524 2532) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,299 INFO L443 ceAbstractionStarter]: For program point L1538-3(lines 1538 1542) no Hoare annotation was computed. [2019-10-22 11:23:35,299 INFO L446 ceAbstractionStarter]: At program point L2529-3(lines 2524 2532) the Hoare annotation is: true [2019-10-22 11:23:35,299 INFO L446 ceAbstractionStarter]: At program point L2463-1(lines 2463 2470) the Hoare annotation is: true [2019-10-22 11:23:35,299 INFO L443 ceAbstractionStarter]: For program point L2463(lines 2463 2470) no Hoare annotation was computed. [2019-10-22 11:23:35,300 INFO L439 ceAbstractionStarter]: At program point L2529-2(lines 2524 2532) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,301 INFO L439 ceAbstractionStarter]: At program point L1538-5(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,301 INFO L443 ceAbstractionStarter]: For program point L1538-6(lines 1538 1542) no Hoare annotation was computed. [2019-10-22 11:23:35,301 INFO L439 ceAbstractionStarter]: At program point L1538-8(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,301 INFO L443 ceAbstractionStarter]: For program point L1803(lines 1802 1948) no Hoare annotation was computed. [2019-10-22 11:23:35,301 INFO L439 ceAbstractionStarter]: At program point L1704(lines 1699 1707) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2019-10-22 11:23:35,301 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:23:35,301 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:23:35,301 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 92) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L119-2(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 86 92) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L119-3(lines 119 130) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L439 ceAbstractionStarter]: At program point L1903(lines 1893 1940) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L1804(lines 1804 1808) no Hoare annotation was computed. [2019-10-22 11:23:35,302 INFO L439 ceAbstractionStarter]: At program point L1474(lines 1457 1480) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse5 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse0 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse4 (= ~rjh~0 2))) (or (and .cse0 (and (= ~__ste_email_to0~0 2) (and .cse1 .cse2) .cse3 .cse4) .cse5 .cse6 .cse7) (and .cse2 .cse1 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5 .cse6 .cse0 .cse3 .cse7 .cse4))) [2019-10-22 11:23:35,302 INFO L446 ceAbstractionStarter]: At program point L1474-1(lines 1457 1480) the Hoare annotation is: true [2019-10-22 11:23:35,302 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1524) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 1508 1524) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L443 ceAbstractionStarter]: For program point L2334(lines 2334 2340) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L443 ceAbstractionStarter]: For program point L2334-2(lines 2334 2340) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L443 ceAbstractionStarter]: For program point L1872(lines 1872 1879) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L443 ceAbstractionStarter]: For program point L1839(lines 1839 1843) no Hoare annotation was computed. [2019-10-22 11:23:35,303 INFO L439 ceAbstractionStarter]: At program point L1609(lines 1 2591) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_setEmailTo_~handle)) (.cse3 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse6 (= ~__ste_email_to0~0 2)) (.cse7 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8 .cse9 .cse10) (and (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse0 .cse1 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-10-22 11:23:35,303 INFO L439 ceAbstractionStarter]: At program point L1609-1(lines 1 2591) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ~rjh~0 2))) (or (and (and .cse0 (and .cse1 (= |ULTIMATE.start_createEmail_#res| 1) .cse2 .cse3)) (= 1 ULTIMATE.start_createEmail_~msg~0)) (and (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 (and (= 0 ~__ste_client_autoResponse1~0) .cse1)) (= 2 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse2 .cse3))) [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L156-2(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L123-2(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L156-3(lines 156 167) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:23:35,304 INFO L439 ceAbstractionStarter]: At program point L91(lines 78 96) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,305 INFO L446 ceAbstractionStarter]: At program point L91-1(lines 78 96) the Hoare annotation is: true [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L1908(lines 1908 1912) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L1512(lines 1512 1523) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L1512-1(lines 1512 1523) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1062) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 1947) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L446 ceAbstractionStarter]: At program point L2471(lines 2453 2473) the Hoare annotation is: true [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L160-2(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:23:35,305 INFO L443 ceAbstractionStarter]: For program point L160-3(lines 160 166) no Hoare annotation was computed. [2019-10-22 11:23:35,306 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:23:35,306 INFO L439 ceAbstractionStarter]: At program point L1845(lines 1835 1945) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,307 INFO L439 ceAbstractionStarter]: At program point L1713(lines 1708 1716) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2019-10-22 11:23:35,307 INFO L443 ceAbstractionStarter]: For program point L2407(lines 2407 2415) no Hoare annotation was computed. [2019-10-22 11:23:35,307 INFO L439 ceAbstractionStarter]: At program point L128(lines 115 133) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= ~__ste_email_to0~0 2) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,307 INFO L439 ceAbstractionStarter]: At program point L128-1(lines 115 133) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,308 INFO L446 ceAbstractionStarter]: At program point L128-2(lines 115 133) the Hoare annotation is: true [2019-10-22 11:23:35,308 INFO L443 ceAbstractionStarter]: For program point L1053(lines 1053 1061) no Hoare annotation was computed. [2019-10-22 11:23:35,308 INFO L446 ceAbstractionStarter]: At program point L128-3(lines 115 133) the Hoare annotation is: true [2019-10-22 11:23:35,308 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1522) no Hoare annotation was computed. [2019-10-22 11:23:35,308 INFO L443 ceAbstractionStarter]: For program point L1516-1(lines 1516 1522) no Hoare annotation was computed. [2019-10-22 11:23:35,308 INFO L443 ceAbstractionStarter]: For program point L1814(lines 1814 1818) no Hoare annotation was computed. [2019-10-22 11:23:35,308 INFO L439 ceAbstractionStarter]: At program point L1914(lines 1904 1939) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,308 INFO L439 ceAbstractionStarter]: At program point L1881(lines 1868 1942) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,308 INFO L443 ceAbstractionStarter]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2019-10-22 11:23:35,309 INFO L439 ceAbstractionStarter]: At program point L1650-1(lines 1 2591) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6)))) [2019-10-22 11:23:35,309 INFO L443 ceAbstractionStarter]: For program point L1650-2(lines 1650 1657) no Hoare annotation was computed. [2019-10-22 11:23:35,309 INFO L443 ceAbstractionStarter]: For program point L1485(lines 1485 1497) no Hoare annotation was computed. [2019-10-22 11:23:35,309 INFO L443 ceAbstractionStarter]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2019-10-22 11:23:35,309 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:23:35,309 INFO L439 ceAbstractionStarter]: At program point L1056-2(lines 1 2591) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,309 INFO L439 ceAbstractionStarter]: At program point L165(lines 152 170) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_setEmailTo_~handle)) (.cse3 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse6 (= ~__ste_email_to0~0 2)) (.cse7 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ~rjh~0 2))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8 .cse9 .cse10))) [2019-10-22 11:23:35,310 INFO L439 ceAbstractionStarter]: At program point L165-1(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,310 INFO L439 ceAbstractionStarter]: At program point L165-2(lines 152 170) the Hoare annotation is: (let ((.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) (and .cse0 (and (= 0 ~__ste_client_autoResponse1~0) .cse1)) .cse2 .cse3) (and (and (and .cse2 (and .cse0 .cse1) .cse3) (= |ULTIMATE.start_createEmail_#res| 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)))) [2019-10-22 11:23:35,310 INFO L446 ceAbstractionStarter]: At program point L165-3(lines 152 170) the Hoare annotation is: true [2019-10-22 11:23:35,310 INFO L439 ceAbstractionStarter]: At program point L1949(lines 1801 1950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-10-22 11:23:35,310 INFO L443 ceAbstractionStarter]: For program point L1850(lines 1850 1854) no Hoare annotation was computed. [2019-10-22 11:23:35,310 INFO L439 ceAbstractionStarter]: At program point L1521(lines 1504 1527) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_outgoing_~msg)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-10-22 11:23:35,310 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1496) no Hoare annotation was computed. [2019-10-22 11:23:35,311 INFO L439 ceAbstractionStarter]: At program point L1521-1(lines 1504 1527) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= ~rjh~0 2)) (.cse5 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and (and (= ~__ste_email_to0~0 2) .cse1 .cse2 .cse3) .cse4 .cse5)) (and (not (= |ULTIMATE.start_isReadable_#res| 0)) (and (and .cse4 (and .cse2 .cse1 .cse3) .cse5) .cse0)))) [2019-10-22 11:23:35,311 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1042) no Hoare annotation was computed. [2019-10-22 11:23:35,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:23:35 BoogieIcfgContainer [2019-10-22 11:23:35,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:23:35,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:23:35,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:23:35,353 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:23:35,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:15" (3/4) ... [2019-10-22 11:23:35,358 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:23:35,383 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 83 nodes and edges [2019-10-22 11:23:35,384 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 47 nodes and edges [2019-10-22 11:23:35,386 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:23:35,387 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:23:35,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,422 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(2 == msg)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,423 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && 2 == client) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((0 == client && handle == 3) && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && ((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 1 && ((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,426 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,427 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == tmp) && !(\result == 0)) && ((((((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-10-22 11:23:35,428 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == msg && ((((__ste_email_to0 == 2 && handle == 3) && 2 == to) && rjh == 2) && \result == 1) && !(handle == 2)) || (!(\result == 0) && ((\result == 1 && (2 == to && handle == 3) && rjh == 2) && !(handle == 2)) && 1 == msg) [2019-10-22 11:23:35,428 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,428 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\result == 0) && ((((handle == msg && handle == 3) && \result == 1) && 2 == to) && rjh == 2) && 1 == msg) || ((handle == msg && (((__ste_email_to0 == 2 && 2 == to) && handle == 3) && rjh == 2) && \result == 1) && 1 == msg)) || (((__ste_email_to0 == 2 && (1 == msg && handle == msg) && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == to) && rjh == 2) [2019-10-22 11:23:35,429 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,429 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((__ste_email_to0 == 2 && 2 == \result) && handle == msg && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == to) && rjh == 2) || ((((2 == to && handle == msg && handle == 3) && rjh == 2) && \result == 1) && 1 == msg) [2019-10-22 11:23:35,429 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,429 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,430 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((handle == msg && ((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && 1 == msg) || (((((__ste_email_to0 == 2 && 2 == \result) && handle == msg && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == client) && 2 == to) && rjh == 2) [2019-10-22 11:23:35,430 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && !(1 == to)) || ((\result == 1 && (2 == to && handle == msg && handle == 3) && rjh == 2) && 1 == msg) [2019-10-22 11:23:35,430 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-10-22 11:23:35,539 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7db8aeaf-1137-4d43-bb91-93f7e97f9953/bin/utaipan/witness.graphml [2019-10-22 11:23:35,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:23:35,541 INFO L168 Benchmark]: Toolchain (without parser) took 22446.21 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 804.3 MB). Free memory was 943.1 MB in the beginning and 839.2 MB in the end (delta: 104.0 MB). Peak memory consumption was 908.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,541 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:35,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 951.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:35,542 INFO L168 Benchmark]: Boogie Preprocessor took 64.98 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,543 INFO L168 Benchmark]: RCFGBuilder took 1212.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.6 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,543 INFO L168 Benchmark]: TraceAbstraction took 19918.62 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 680.0 MB). Free memory was 956.6 MB in the beginning and 886.8 MB in the end (delta: 69.8 MB). Peak memory consumption was 750.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,544 INFO L168 Benchmark]: Witness Printer took 187.14 ms. Allocated memory is still 1.8 GB. Free memory was 886.8 MB in the beginning and 839.2 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:35,546 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 951.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -127.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.72 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.98 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1212.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.6 MB in the end (delta: 106.6 MB). Peak memory consumption was 106.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19918.62 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 680.0 MB). Free memory was 956.6 MB in the beginning and 886.8 MB in the end (delta: 69.8 MB). Peak memory consumption was 750.2 MB. Max. memory is 11.5 GB. * Witness Printer took 187.14 ms. Allocated memory is still 1.8 GB. Free memory was 886.8 MB in the beginning and 839.2 MB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2349]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2349]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && 2 == client) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((0 == client && handle == 3) && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == msg && ((handle == 3 && \result == 1) && 2 == to) && rjh == 2) && 1 == msg) || (((((__ste_email_to0 == 2 && 2 == \result) && handle == msg && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == client) && 2 == to) && rjh == 2) - InvariantResult [Line: 1801]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1504]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(2 == msg)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1717]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1504]: Loop Invariant Derived loop invariant: (1 == msg && ((((__ste_email_to0 == 2 && handle == 3) && 2 == to) && rjh == 2) && \result == 1) && !(handle == 2)) || (!(\result == 0) && ((\result == 1 && (2 == to && handle == 3) && rjh == 2) && !(handle == 2)) && 1 == msg) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || (((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: ((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && !(1 == to)) || ((\result == 1 && (2 == to && handle == msg && handle == 3) && rjh == 2) && 1 == msg) - InvariantResult [Line: 1457]: Loop Invariant Derived loop invariant: ((((\result == 1 && ((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((__ste_email_to0 == 2 && 2 == \result) && handle == msg && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == to) && rjh == 2) || ((((2 == to && handle == msg && handle == 3) && rjh == 2) && \result == 1) && 1 == msg) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((!(\result == 0) && ((((handle == msg && handle == 3) && \result == 1) && 2 == to) && rjh == 2) && 1 == msg) || ((handle == msg && (((__ste_email_to0 == 2 && 2 == to) && handle == 3) && rjh == 2) && \result == 1) && 1 == msg)) || (((__ste_email_to0 == 2 && (1 == msg && handle == msg) && 0 == __ste_client_autoResponse1 && handle == 3) && 2 == to) && rjh == 2) - InvariantResult [Line: 2496]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1868]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2496]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2463]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && rjh == handle) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1708]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && \result == 1) && handle == 3) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (!(\result == 0) && (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1904]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1915]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2326]: Loop Invariant Derived loop invariant: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2326]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1857]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1821]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1846]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1835]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1802]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2453]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((handle == 3 && !(handle == 2)) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: ((((\result == 1 && ((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1810]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((!(0 == tmp) && !(\result == 0)) && ((((((__ste_email_to0 == 2 && handle == msg && handle == 3) && 2 == to) && rjh == 2) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 1 == msg) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2583]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 2 error locations. Result: SAFE, OverallTime: 19.7s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.2s, HoareTripleCheckerStatistics: 3040 SDtfs, 6547 SDslu, 7485 SDs, 0 SdLazy, 777 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2553 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 615 NumberOfFragments, 1619 HoareAnnotationTreeSize, 63 FomulaSimplifications, 57820596 FormulaSimplificationTreeSizeReduction, 4.8s HoareSimplificationTime, 63 FomulaSimplificationsInter, 4341131 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 32562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...