./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72fcebcfa7a668c9bb314320ec142761ff8c6a6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:48:14,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:48:14,465 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:48:14,473 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:48:14,473 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:48:14,474 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:48:14,475 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:48:14,476 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:48:14,477 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:48:14,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:48:14,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:48:14,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:48:14,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:48:14,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:48:14,480 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:48:14,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:48:14,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:48:14,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:48:14,484 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:48:14,485 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:48:14,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:48:14,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:48:14,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:48:14,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:48:14,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:48:14,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:48:14,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:48:14,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:48:14,491 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:48:14,492 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:48:14,492 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:48:14,493 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:48:14,493 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:48:14,493 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:48:14,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:48:14,494 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:48:14,494 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 10:48:14,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:48:14,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:48:14,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:48:14,504 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 10:48:14,505 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 10:48:14,505 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 10:48:14,506 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 10:48:14,506 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 10:48:14,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:48:14,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:48:14,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:48:14,508 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:48:14,508 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:48:14,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:48:14,508 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:48:14,508 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:48:14,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:48:14,509 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 10:48:14,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:48:14,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:48:14,510 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 10:48:14,510 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2018-11-18 10:48:14,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:48:14,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:48:14,542 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:48:14,543 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:48:14,543 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:48:14,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-11-18 10:48:14,580 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/data/ef0077060/a39cd05de6fe47df9288861c731b99cf/FLAG38fe1041d [2018-11-18 10:48:14,990 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:48:14,990 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-11-18 10:48:14,998 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/data/ef0077060/a39cd05de6fe47df9288861c731b99cf/FLAG38fe1041d [2018-11-18 10:48:15,011 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/data/ef0077060/a39cd05de6fe47df9288861c731b99cf [2018-11-18 10:48:15,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:48:15,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:48:15,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:15,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:48:15,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:48:15,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d0d35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15, skipping insertion in model container [2018-11-18 10:48:15,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:48:15,057 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:48:15,199 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:15,201 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:48:15,233 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:48:15,241 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:48:15,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15 WrapperNode [2018-11-18 10:48:15,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:48:15,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:15,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:48:15,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:48:15,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:48:15,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:48:15,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:48:15,299 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:48:15,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... [2018-11-18 10:48:15,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:48:15,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:48:15,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:48:15,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:48:15,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:48:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:48:15,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:48:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 10:48:15,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 10:48:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:48:15,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:48:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:48:15,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:48:15,467 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 10:48:15,467 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 10:48:15,797 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:48:15,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:15 BoogieIcfgContainer [2018-11-18 10:48:15,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:48:15,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:48:15,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:48:15,800 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:48:15,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:48:15" (1/3) ... [2018-11-18 10:48:15,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb1caf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:48:15, skipping insertion in model container [2018-11-18 10:48:15,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:48:15" (2/3) ... [2018-11-18 10:48:15,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fb1caf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:48:15, skipping insertion in model container [2018-11-18 10:48:15,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:15" (3/3) ... [2018-11-18 10:48:15,803 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-11-18 10:48:15,812 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:48:15,818 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:48:15,832 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:48:15,859 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:48:15,859 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:48:15,859 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:48:15,859 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:48:15,860 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:48:15,860 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:48:15,860 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:48:15,860 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:48:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-18 10:48:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 10:48:15,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:15,883 INFO L375 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] [2018-11-18 10:48:15,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:15,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash 171568588, now seen corresponding path program 1 times [2018-11-18 10:48:15,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:15,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:15,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:16,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:16,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:16,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:16,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,071 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-18 10:48:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:16,136 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-18 10:48:16,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:16,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 10:48:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:16,147 INFO L225 Difference]: With dead ends: 377 [2018-11-18 10:48:16,147 INFO L226 Difference]: Without dead ends: 220 [2018-11-18 10:48:16,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-18 10:48:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-18 10:48:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-18 10:48:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-18 10:48:16,188 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 30 [2018-11-18 10:48:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:16,189 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-18 10:48:16,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-18 10:48:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 10:48:16,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:16,191 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:16,191 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:16,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1775774517, now seen corresponding path program 1 times [2018-11-18 10:48:16,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:16,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:16,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:48:16,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:16,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:16,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:16,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,255 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-18 10:48:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:16,393 INFO L93 Difference]: Finished difference Result 472 states and 709 transitions. [2018-11-18 10:48:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:16,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 10:48:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:16,395 INFO L225 Difference]: With dead ends: 472 [2018-11-18 10:48:16,395 INFO L226 Difference]: Without dead ends: 264 [2018-11-18 10:48:16,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-18 10:48:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-11-18 10:48:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-18 10:48:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2018-11-18 10:48:16,412 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 45 [2018-11-18 10:48:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:16,412 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2018-11-18 10:48:16,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2018-11-18 10:48:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:48:16,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:16,414 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:16,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:16,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:16,414 INFO L82 PathProgramCache]: Analyzing trace with hash 6273938, now seen corresponding path program 1 times [2018-11-18 10:48:16,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:16,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 10:48:16,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:16,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:16,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:16,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,488 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand 3 states. [2018-11-18 10:48:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:16,633 INFO L93 Difference]: Finished difference Result 604 states and 908 transitions. [2018-11-18 10:48:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:16,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 10:48:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:16,635 INFO L225 Difference]: With dead ends: 604 [2018-11-18 10:48:16,635 INFO L226 Difference]: Without dead ends: 358 [2018-11-18 10:48:16,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-18 10:48:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2018-11-18 10:48:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 10:48:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 474 transitions. [2018-11-18 10:48:16,652 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 474 transitions. Word has length 63 [2018-11-18 10:48:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:16,652 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 474 transitions. [2018-11-18 10:48:16,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 474 transitions. [2018-11-18 10:48:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 10:48:16,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:16,655 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:16,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:16,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:16,656 INFO L82 PathProgramCache]: Analyzing trace with hash -127739568, now seen corresponding path program 1 times [2018-11-18 10:48:16,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:16,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:16,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 10:48:16,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:16,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:16,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:16,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:16,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:16,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,710 INFO L87 Difference]: Start difference. First operand 340 states and 474 transitions. Second operand 3 states. [2018-11-18 10:48:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:16,831 INFO L93 Difference]: Finished difference Result 716 states and 1013 transitions. [2018-11-18 10:48:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:16,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 10:48:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:16,833 INFO L225 Difference]: With dead ends: 716 [2018-11-18 10:48:16,833 INFO L226 Difference]: Without dead ends: 388 [2018-11-18 10:48:16,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-18 10:48:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2018-11-18 10:48:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-18 10:48:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2018-11-18 10:48:16,845 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 63 [2018-11-18 10:48:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:16,846 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2018-11-18 10:48:16,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2018-11-18 10:48:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 10:48:16,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:16,848 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:16,848 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:16,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1202766391, now seen corresponding path program 1 times [2018-11-18 10:48:16,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:16,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:16,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:16,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 10:48:16,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:16,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:16,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:16,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:16,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:16,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:16,897 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand 3 states. [2018-11-18 10:48:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,047 INFO L93 Difference]: Finished difference Result 856 states and 1218 transitions. [2018-11-18 10:48:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-18 10:48:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,050 INFO L225 Difference]: With dead ends: 856 [2018-11-18 10:48:17,050 INFO L226 Difference]: Without dead ends: 486 [2018-11-18 10:48:17,051 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-18 10:48:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 460. [2018-11-18 10:48:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-11-18 10:48:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 660 transitions. [2018-11-18 10:48:17,065 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 660 transitions. Word has length 77 [2018-11-18 10:48:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,065 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 660 transitions. [2018-11-18 10:48:17,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 660 transitions. [2018-11-18 10:48:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 10:48:17,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,067 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,068 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,068 INFO L82 PathProgramCache]: Analyzing trace with hash -408124070, now seen corresponding path program 1 times [2018-11-18 10:48:17,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 10:48:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,138 INFO L87 Difference]: Start difference. First operand 460 states and 660 transitions. Second operand 3 states. [2018-11-18 10:48:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,237 INFO L93 Difference]: Finished difference Result 958 states and 1383 transitions. [2018-11-18 10:48:17,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-18 10:48:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,245 INFO L225 Difference]: With dead ends: 958 [2018-11-18 10:48:17,245 INFO L226 Difference]: Without dead ends: 510 [2018-11-18 10:48:17,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-11-18 10:48:17,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 504. [2018-11-18 10:48:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-18 10:48:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 714 transitions. [2018-11-18 10:48:17,255 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 714 transitions. Word has length 80 [2018-11-18 10:48:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,255 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 714 transitions. [2018-11-18 10:48:17,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 714 transitions. [2018-11-18 10:48:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 10:48:17,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,257 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,257 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1386271406, now seen corresponding path program 1 times [2018-11-18 10:48:17,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 10:48:17,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,299 INFO L87 Difference]: Start difference. First operand 504 states and 714 transitions. Second operand 3 states. [2018-11-18 10:48:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,337 INFO L93 Difference]: Finished difference Result 996 states and 1417 transitions. [2018-11-18 10:48:17,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-18 10:48:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,340 INFO L225 Difference]: With dead ends: 996 [2018-11-18 10:48:17,340 INFO L226 Difference]: Without dead ends: 749 [2018-11-18 10:48:17,340 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-18 10:48:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2018-11-18 10:48:17,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-11-18 10:48:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1062 transitions. [2018-11-18 10:48:17,353 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1062 transitions. Word has length 101 [2018-11-18 10:48:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,353 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 1062 transitions. [2018-11-18 10:48:17,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1062 transitions. [2018-11-18 10:48:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 10:48:17,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,354 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,355 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1918858680, now seen corresponding path program 1 times [2018-11-18 10:48:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 10:48:17,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,382 INFO L87 Difference]: Start difference. First operand 749 states and 1062 transitions. Second operand 3 states. [2018-11-18 10:48:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,416 INFO L93 Difference]: Finished difference Result 996 states and 1414 transitions. [2018-11-18 10:48:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-18 10:48:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,419 INFO L225 Difference]: With dead ends: 996 [2018-11-18 10:48:17,419 INFO L226 Difference]: Without dead ends: 994 [2018-11-18 10:48:17,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-11-18 10:48:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2018-11-18 10:48:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-11-18 10:48:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1412 transitions. [2018-11-18 10:48:17,433 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1412 transitions. Word has length 103 [2018-11-18 10:48:17,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,433 INFO L480 AbstractCegarLoop]: Abstraction has 994 states and 1412 transitions. [2018-11-18 10:48:17,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1412 transitions. [2018-11-18 10:48:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-18 10:48:17,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,435 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,435 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1984812912, now seen corresponding path program 1 times [2018-11-18 10:48:17,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 10:48:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,472 INFO L87 Difference]: Start difference. First operand 994 states and 1412 transitions. Second operand 3 states. [2018-11-18 10:48:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,557 INFO L93 Difference]: Finished difference Result 2086 states and 2982 transitions. [2018-11-18 10:48:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-11-18 10:48:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,560 INFO L225 Difference]: With dead ends: 2086 [2018-11-18 10:48:17,560 INFO L226 Difference]: Without dead ends: 1104 [2018-11-18 10:48:17,561 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2018-11-18 10:48:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1090. [2018-11-18 10:48:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-18 10:48:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1528 transitions. [2018-11-18 10:48:17,576 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1528 transitions. Word has length 129 [2018-11-18 10:48:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,577 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1528 transitions. [2018-11-18 10:48:17,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1528 transitions. [2018-11-18 10:48:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-18 10:48:17,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,579 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,579 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,579 INFO L82 PathProgramCache]: Analyzing trace with hash -2074477414, now seen corresponding path program 1 times [2018-11-18 10:48:17,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-18 10:48:17,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,617 INFO L87 Difference]: Start difference. First operand 1090 states and 1528 transitions. Second operand 3 states. [2018-11-18 10:48:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,726 INFO L93 Difference]: Finished difference Result 2376 states and 3384 transitions. [2018-11-18 10:48:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-11-18 10:48:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,730 INFO L225 Difference]: With dead ends: 2376 [2018-11-18 10:48:17,730 INFO L226 Difference]: Without dead ends: 1290 [2018-11-18 10:48:17,732 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-18 10:48:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1250. [2018-11-18 10:48:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-11-18 10:48:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1756 transitions. [2018-11-18 10:48:17,748 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1756 transitions. Word has length 151 [2018-11-18 10:48:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 1250 states and 1756 transitions. [2018-11-18 10:48:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1756 transitions. [2018-11-18 10:48:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 10:48:17,751 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,751 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -53614923, now seen corresponding path program 1 times [2018-11-18 10:48:17,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-18 10:48:17,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,824 INFO L87 Difference]: Start difference. First operand 1250 states and 1756 transitions. Second operand 3 states. [2018-11-18 10:48:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:17,912 INFO L93 Difference]: Finished difference Result 2612 states and 3644 transitions. [2018-11-18 10:48:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:17,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-18 10:48:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:17,915 INFO L225 Difference]: With dead ends: 2612 [2018-11-18 10:48:17,915 INFO L226 Difference]: Without dead ends: 1374 [2018-11-18 10:48:17,917 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2018-11-18 10:48:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1366. [2018-11-18 10:48:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2018-11-18 10:48:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1892 transitions. [2018-11-18 10:48:17,935 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1892 transitions. Word has length 188 [2018-11-18 10:48:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:17,935 INFO L480 AbstractCegarLoop]: Abstraction has 1366 states and 1892 transitions. [2018-11-18 10:48:17,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1892 transitions. [2018-11-18 10:48:17,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-18 10:48:17,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:17,938 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:17,938 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:17,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:17,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1907959735, now seen corresponding path program 1 times [2018-11-18 10:48:17,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:17,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:17,979 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-18 10:48:17,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:17,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:17,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:17,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:17,980 INFO L87 Difference]: Start difference. First operand 1366 states and 1892 transitions. Second operand 3 states. [2018-11-18 10:48:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:18,076 INFO L93 Difference]: Finished difference Result 2860 states and 3952 transitions. [2018-11-18 10:48:18,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:18,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-18 10:48:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:18,080 INFO L225 Difference]: With dead ends: 2860 [2018-11-18 10:48:18,080 INFO L226 Difference]: Without dead ends: 1506 [2018-11-18 10:48:18,082 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2018-11-18 10:48:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1494. [2018-11-18 10:48:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2018-11-18 10:48:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2040 transitions. [2018-11-18 10:48:18,102 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2040 transitions. Word has length 188 [2018-11-18 10:48:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:18,103 INFO L480 AbstractCegarLoop]: Abstraction has 1494 states and 2040 transitions. [2018-11-18 10:48:18,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2040 transitions. [2018-11-18 10:48:18,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 10:48:18,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:18,105 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:18,106 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:18,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:18,106 INFO L82 PathProgramCache]: Analyzing trace with hash 340460485, now seen corresponding path program 1 times [2018-11-18 10:48:18,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:18,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:18,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-18 10:48:18,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:18,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:18,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,155 INFO L87 Difference]: Start difference. First operand 1494 states and 2040 transitions. Second operand 3 states. [2018-11-18 10:48:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:18,191 INFO L93 Difference]: Finished difference Result 4454 states and 6084 transitions. [2018-11-18 10:48:18,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:18,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-18 10:48:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:18,196 INFO L225 Difference]: With dead ends: 4454 [2018-11-18 10:48:18,197 INFO L226 Difference]: Without dead ends: 2972 [2018-11-18 10:48:18,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-11-18 10:48:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2970. [2018-11-18 10:48:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2970 states. [2018-11-18 10:48:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4055 transitions. [2018-11-18 10:48:18,242 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4055 transitions. Word has length 219 [2018-11-18 10:48:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:18,243 INFO L480 AbstractCegarLoop]: Abstraction has 2970 states and 4055 transitions. [2018-11-18 10:48:18,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4055 transitions. [2018-11-18 10:48:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-18 10:48:18,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:18,247 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:18,247 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:18,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1992932153, now seen corresponding path program 1 times [2018-11-18 10:48:18,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:18,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:18,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-18 10:48:18,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:18,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:18,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:18,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:18,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:18,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,319 INFO L87 Difference]: Start difference. First operand 2970 states and 4055 transitions. Second operand 3 states. [2018-11-18 10:48:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:18,458 INFO L93 Difference]: Finished difference Result 6236 states and 8514 transitions. [2018-11-18 10:48:18,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-11-18 10:48:18,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:18,467 INFO L225 Difference]: With dead ends: 6236 [2018-11-18 10:48:18,468 INFO L226 Difference]: Without dead ends: 3278 [2018-11-18 10:48:18,472 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2018-11-18 10:48:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3262. [2018-11-18 10:48:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2018-11-18 10:48:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4387 transitions. [2018-11-18 10:48:18,533 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4387 transitions. Word has length 219 [2018-11-18 10:48:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:18,534 INFO L480 AbstractCegarLoop]: Abstraction has 3262 states and 4387 transitions. [2018-11-18 10:48:18,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4387 transitions. [2018-11-18 10:48:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-18 10:48:18,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:18,540 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:18,540 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:18,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:18,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1255885273, now seen corresponding path program 1 times [2018-11-18 10:48:18,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-11-18 10:48:18,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:18,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:18,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:18,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:18,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:18,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,615 INFO L87 Difference]: Start difference. First operand 3262 states and 4387 transitions. Second operand 3 states. [2018-11-18 10:48:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:18,748 INFO L93 Difference]: Finished difference Result 6664 states and 8958 transitions. [2018-11-18 10:48:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:18,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-11-18 10:48:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:18,758 INFO L225 Difference]: With dead ends: 6664 [2018-11-18 10:48:18,758 INFO L226 Difference]: Without dead ends: 3414 [2018-11-18 10:48:18,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2018-11-18 10:48:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3398. [2018-11-18 10:48:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2018-11-18 10:48:18,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4543 transitions. [2018-11-18 10:48:18,826 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4543 transitions. Word has length 244 [2018-11-18 10:48:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:18,826 INFO L480 AbstractCegarLoop]: Abstraction has 3398 states and 4543 transitions. [2018-11-18 10:48:18,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4543 transitions. [2018-11-18 10:48:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-18 10:48:18,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:18,833 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:18,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:18,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:18,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1251056548, now seen corresponding path program 1 times [2018-11-18 10:48:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:18,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-18 10:48:18,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:18,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:18,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:18,926 INFO L87 Difference]: Start difference. First operand 3398 states and 4543 transitions. Second operand 3 states. [2018-11-18 10:48:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:19,080 INFO L93 Difference]: Finished difference Result 7192 states and 9750 transitions. [2018-11-18 10:48:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:19,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-11-18 10:48:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:19,091 INFO L225 Difference]: With dead ends: 7192 [2018-11-18 10:48:19,091 INFO L226 Difference]: Without dead ends: 3806 [2018-11-18 10:48:19,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2018-11-18 10:48:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3718. [2018-11-18 10:48:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-11-18 10:48:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 4919 transitions. [2018-11-18 10:48:19,169 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 4919 transitions. Word has length 255 [2018-11-18 10:48:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:19,170 INFO L480 AbstractCegarLoop]: Abstraction has 3718 states and 4919 transitions. [2018-11-18 10:48:19,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4919 transitions. [2018-11-18 10:48:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-11-18 10:48:19,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:19,177 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:19,177 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:19,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:19,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1320979294, now seen corresponding path program 1 times [2018-11-18 10:48:19,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-18 10:48:19,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:19,263 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:19,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:19,264 INFO L87 Difference]: Start difference. First operand 3718 states and 4919 transitions. Second operand 3 states. [2018-11-18 10:48:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:19,418 INFO L93 Difference]: Finished difference Result 7840 states and 10310 transitions. [2018-11-18 10:48:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:19,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2018-11-18 10:48:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:19,435 INFO L225 Difference]: With dead ends: 7840 [2018-11-18 10:48:19,435 INFO L226 Difference]: Without dead ends: 4134 [2018-11-18 10:48:19,441 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:19,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2018-11-18 10:48:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3846. [2018-11-18 10:48:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3846 states. [2018-11-18 10:48:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5071 transitions. [2018-11-18 10:48:19,517 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5071 transitions. Word has length 270 [2018-11-18 10:48:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:19,518 INFO L480 AbstractCegarLoop]: Abstraction has 3846 states and 5071 transitions. [2018-11-18 10:48:19,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5071 transitions. [2018-11-18 10:48:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-18 10:48:19,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:19,525 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:19,525 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:19,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2043197932, now seen corresponding path program 1 times [2018-11-18 10:48:19,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-11-18 10:48:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:19,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:19,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:19,688 INFO L87 Difference]: Start difference. First operand 3846 states and 5071 transitions. Second operand 3 states. [2018-11-18 10:48:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:19,797 INFO L93 Difference]: Finished difference Result 10994 states and 14573 transitions. [2018-11-18 10:48:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:19,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-11-18 10:48:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:19,812 INFO L225 Difference]: With dead ends: 10994 [2018-11-18 10:48:19,812 INFO L226 Difference]: Without dead ends: 7160 [2018-11-18 10:48:19,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2018-11-18 10:48:19,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 7158. [2018-11-18 10:48:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2018-11-18 10:48:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 9493 transitions. [2018-11-18 10:48:19,956 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 9493 transitions. Word has length 271 [2018-11-18 10:48:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 7158 states and 9493 transitions. [2018-11-18 10:48:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 9493 transitions. [2018-11-18 10:48:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-18 10:48:19,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:19,967 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:19,967 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:19,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:19,968 INFO L82 PathProgramCache]: Analyzing trace with hash 2027340829, now seen corresponding path program 1 times [2018-11-18 10:48:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:19,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:19,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-11-18 10:48:20,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:20,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:20,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:20,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:20,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:20,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:20,039 INFO L87 Difference]: Start difference. First operand 7158 states and 9493 transitions. Second operand 3 states. [2018-11-18 10:48:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:20,207 INFO L93 Difference]: Finished difference Result 14312 states and 18962 transitions. [2018-11-18 10:48:20,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:20,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-11-18 10:48:20,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:20,220 INFO L225 Difference]: With dead ends: 14312 [2018-11-18 10:48:20,220 INFO L226 Difference]: Without dead ends: 7166 [2018-11-18 10:48:20,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2018-11-18 10:48:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 7134. [2018-11-18 10:48:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-11-18 10:48:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9277 transitions. [2018-11-18 10:48:20,343 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9277 transitions. Word has length 272 [2018-11-18 10:48:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:20,343 INFO L480 AbstractCegarLoop]: Abstraction has 7134 states and 9277 transitions. [2018-11-18 10:48:20,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9277 transitions. [2018-11-18 10:48:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-18 10:48:20,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:20,354 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:20,354 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash -517836981, now seen corresponding path program 1 times [2018-11-18 10:48:20,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:20,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:20,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-11-18 10:48:20,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:20,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:20,479 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-11-18 10:48:20,481 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [246], [249], [257], [260], [265], [268], [276], [281], [283], [289], [292], [300], [302], [304], [307], [315], [320], [322], [325], [327], [332], [334], [337], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 10:48:20,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:48:20,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:48:20,932 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:48:20,933 INFO L272 AbstractInterpreter]: Visited 99 different actions 201 times. Merged at 73 different actions 90 times. Widened at 1 different actions 1 times. Performed 956 root evaluator evaluations with a maximum evaluation depth of 3. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 17 fixpoints after 13 different actions. Largest state had 102 variables. [2018-11-18 10:48:20,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:20,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:48:20,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:20,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:20,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:20,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:48:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:21,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-11-18 10:48:21,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-11-18 10:48:21,192 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:48:21,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2018-11-18 10:48:21,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:21,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:48:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:48:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 10:48:21,193 INFO L87 Difference]: Start difference. First operand 7134 states and 9277 transitions. Second operand 4 states. [2018-11-18 10:48:21,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:21,376 INFO L93 Difference]: Finished difference Result 14435 states and 18780 transitions. [2018-11-18 10:48:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:48:21,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2018-11-18 10:48:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:21,385 INFO L225 Difference]: With dead ends: 14435 [2018-11-18 10:48:21,385 INFO L226 Difference]: Without dead ends: 7285 [2018-11-18 10:48:21,393 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 587 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 10:48:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7285 states. [2018-11-18 10:48:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7285 to 7141. [2018-11-18 10:48:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2018-11-18 10:48:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 9286 transitions. [2018-11-18 10:48:21,556 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 9286 transitions. Word has length 295 [2018-11-18 10:48:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:21,556 INFO L480 AbstractCegarLoop]: Abstraction has 7141 states and 9286 transitions. [2018-11-18 10:48:21,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:48:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 9286 transitions. [2018-11-18 10:48:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-18 10:48:21,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:21,563 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:21,564 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:21,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -194056250, now seen corresponding path program 1 times [2018-11-18 10:48:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:21,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-18 10:48:21,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:21,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:21,630 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-11-18 10:48:21,631 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [289], [292], [300], [302], [304], [307], [315], [320], [322], [325], [327], [332], [334], [337], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 10:48:21,634 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:48:21,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:48:22,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:48:22,030 INFO L272 AbstractInterpreter]: Visited 108 different actions 377 times. Merged at 89 different actions 235 times. Widened at 1 different actions 1 times. Performed 1906 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1906 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 40 fixpoints after 18 different actions. Largest state had 104 variables. [2018-11-18 10:48:22,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:22,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:48:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:22,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:22,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:22,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:48:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:22,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:22,146 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-18 10:48:22,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-18 10:48:22,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:48:22,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 10:48:22,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:48:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:48:22,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:48:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:48:22,258 INFO L87 Difference]: Start difference. First operand 7141 states and 9286 transitions. Second operand 4 states. [2018-11-18 10:48:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:22,513 INFO L93 Difference]: Finished difference Result 14185 states and 18444 transitions. [2018-11-18 10:48:22,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:48:22,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-11-18 10:48:22,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:22,524 INFO L225 Difference]: With dead ends: 14185 [2018-11-18 10:48:22,524 INFO L226 Difference]: Without dead ends: 10703 [2018-11-18 10:48:22,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:48:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2018-11-18 10:48:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 9101. [2018-11-18 10:48:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9101 states. [2018-11-18 10:48:22,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9101 states to 9101 states and 11840 transitions. [2018-11-18 10:48:22,646 INFO L78 Accepts]: Start accepts. Automaton has 9101 states and 11840 transitions. Word has length 309 [2018-11-18 10:48:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:22,646 INFO L480 AbstractCegarLoop]: Abstraction has 9101 states and 11840 transitions. [2018-11-18 10:48:22,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:48:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 9101 states and 11840 transitions. [2018-11-18 10:48:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-11-18 10:48:22,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:22,654 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:22,655 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:22,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1202097003, now seen corresponding path program 2 times [2018-11-18 10:48:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:22,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:22,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:22,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 439 proven. 6 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-18 10:48:22,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:22,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:22,727 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 10:48:22,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 10:48:22,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:22,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:22,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 10:48:22,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 10:48:22,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 10:48:22,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 10:48:22,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-11-18 10:48:22,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-11-18 10:48:22,880 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:48:22,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-18 10:48:22,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:22,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:48:22,881 INFO L87 Difference]: Start difference. First operand 9101 states and 11840 transitions. Second operand 3 states. [2018-11-18 10:48:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:23,092 INFO L93 Difference]: Finished difference Result 18639 states and 24279 transitions. [2018-11-18 10:48:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:23,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-11-18 10:48:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:23,103 INFO L225 Difference]: With dead ends: 18639 [2018-11-18 10:48:23,103 INFO L226 Difference]: Without dead ends: 9557 [2018-11-18 10:48:23,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:48:23,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9557 states. [2018-11-18 10:48:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9557 to 9485. [2018-11-18 10:48:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9485 states. [2018-11-18 10:48:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9485 states to 9485 states and 12344 transitions. [2018-11-18 10:48:23,224 INFO L78 Accepts]: Start accepts. Automaton has 9485 states and 12344 transitions. Word has length 323 [2018-11-18 10:48:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:23,225 INFO L480 AbstractCegarLoop]: Abstraction has 9485 states and 12344 transitions. [2018-11-18 10:48:23,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9485 states and 12344 transitions. [2018-11-18 10:48:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-11-18 10:48:23,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:23,233 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:23,233 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:23,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1193097713, now seen corresponding path program 1 times [2018-11-18 10:48:23,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:23,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:23,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:48:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:23,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 1034 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 10:48:23,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:23,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:23,327 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 395 with the following transitions: [2018-11-18 10:48:23,328 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [270], [276], [281], [283], [287], [289], [292], [300], [302], [304], [307], [309], [315], [320], [322], [325], [327], [332], [334], [337], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 10:48:23,331 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:48:23,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:48:23,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:48:23,730 INFO L272 AbstractInterpreter]: Visited 112 different actions 413 times. Merged at 94 different actions 256 times. Widened at 1 different actions 1 times. Performed 2124 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 54 fixpoints after 23 different actions. Largest state had 104 variables. [2018-11-18 10:48:23,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:23,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:48:23,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:23,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:23,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:48:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:23,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2018-11-18 10:48:23,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2018-11-18 10:48:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 10:48:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-18 10:48:24,085 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:24,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:24,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:24,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:48:24,086 INFO L87 Difference]: Start difference. First operand 9485 states and 12344 transitions. Second operand 3 states. [2018-11-18 10:48:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:24,242 INFO L93 Difference]: Finished difference Result 23659 states and 30773 transitions. [2018-11-18 10:48:24,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:24,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2018-11-18 10:48:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:24,263 INFO L225 Difference]: With dead ends: 23659 [2018-11-18 10:48:24,264 INFO L226 Difference]: Without dead ends: 14193 [2018-11-18 10:48:24,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 10:48:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2018-11-18 10:48:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 14193. [2018-11-18 10:48:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14193 states. [2018-11-18 10:48:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14193 states to 14193 states and 18430 transitions. [2018-11-18 10:48:24,506 INFO L78 Accepts]: Start accepts. Automaton has 14193 states and 18430 transitions. Word has length 394 [2018-11-18 10:48:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:24,506 INFO L480 AbstractCegarLoop]: Abstraction has 14193 states and 18430 transitions. [2018-11-18 10:48:24,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14193 states and 18430 transitions. [2018-11-18 10:48:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-18 10:48:24,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:24,526 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:24,526 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:24,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1108126713, now seen corresponding path program 1 times [2018-11-18 10:48:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:24,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:24,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:24,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:24,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 10:48:24,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:24,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:24,668 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-11-18 10:48:24,668 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [270], [276], [281], [283], [289], [292], [294], [300], [302], [304], [307], [309], [315], [320], [322], [325], [327], [332], [334], [337], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 10:48:24,671 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:48:24,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:48:25,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:48:25,127 INFO L272 AbstractInterpreter]: Visited 112 different actions 339 times. Merged at 93 different actions 194 times. Never widened. Performed 1750 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1750 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 42 fixpoints after 17 different actions. Largest state had 104 variables. [2018-11-18 10:48:25,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:25,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:48:25,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:25,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:25,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:48:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:25,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 10:48:25,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 10:48:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:48:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 10:48:25,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:48:25,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:48:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:48:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:48:25,467 INFO L87 Difference]: Start difference. First operand 14193 states and 18430 transitions. Second operand 4 states. [2018-11-18 10:48:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:26,105 INFO L93 Difference]: Finished difference Result 31888 states and 41215 transitions. [2018-11-18 10:48:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:48:26,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-18 10:48:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:26,133 INFO L225 Difference]: With dead ends: 31888 [2018-11-18 10:48:26,133 INFO L226 Difference]: Without dead ends: 17702 [2018-11-18 10:48:26,149 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:48:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17702 states. [2018-11-18 10:48:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17702 to 14986. [2018-11-18 10:48:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14986 states. [2018-11-18 10:48:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14986 states to 14986 states and 19037 transitions. [2018-11-18 10:48:26,388 INFO L78 Accepts]: Start accepts. Automaton has 14986 states and 19037 transitions. Word has length 396 [2018-11-18 10:48:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:26,389 INFO L480 AbstractCegarLoop]: Abstraction has 14986 states and 19037 transitions. [2018-11-18 10:48:26,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:48:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 14986 states and 19037 transitions. [2018-11-18 10:48:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-18 10:48:26,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:26,409 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:26,410 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:26,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1579413492, now seen corresponding path program 1 times [2018-11-18 10:48:26,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:26,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:26,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:26,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2124 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-18 10:48:26,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:48:26,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:48:26,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 10:48:26,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:48:26,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:48:26,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:26,529 INFO L87 Difference]: Start difference. First operand 14986 states and 19037 transitions. Second operand 3 states. [2018-11-18 10:48:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:26,994 INFO L93 Difference]: Finished difference Result 28451 states and 35780 transitions. [2018-11-18 10:48:26,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:48:26,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-18 10:48:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:27,001 INFO L225 Difference]: With dead ends: 28451 [2018-11-18 10:48:27,001 INFO L226 Difference]: Without dead ends: 5705 [2018-11-18 10:48:27,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:48:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5705 states. [2018-11-18 10:48:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5705 to 5352. [2018-11-18 10:48:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5352 states. [2018-11-18 10:48:27,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 6603 transitions. [2018-11-18 10:48:27,063 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 6603 transitions. Word has length 436 [2018-11-18 10:48:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:27,064 INFO L480 AbstractCegarLoop]: Abstraction has 5352 states and 6603 transitions. [2018-11-18 10:48:27,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:48:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 6603 transitions. [2018-11-18 10:48:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-11-18 10:48:27,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:48:27,071 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:48:27,071 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:48:27,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 696372751, now seen corresponding path program 1 times [2018-11-18 10:48:27,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 10:48:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:27,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:48:27,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 10:48:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-11-18 10:48:27,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:27,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 10:48:27,161 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 464 with the following transitions: [2018-11-18 10:48:27,162 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [184], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [279], [283], [289], [292], [300], [302], [304], [307], [315], [320], [322], [325], [327], [332], [334], [337], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [413], [418], [423], [425], [430], [433], [437], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 10:48:27,163 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 10:48:27,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 10:48:27,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 10:48:27,371 INFO L272 AbstractInterpreter]: Visited 114 different actions 322 times. Merged at 93 different actions 182 times. Never widened. Performed 1658 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1658 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 33 fixpoints after 16 different actions. Largest state had 105 variables. [2018-11-18 10:48:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:48:27,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 10:48:27,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 10:48:27,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 10:48:27,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:48:27,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 10:48:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:48:27,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:48:27,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-11-18 10:48:27,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 10:48:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-11-18 10:48:27,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 10:48:27,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 10:48:27,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 10:48:27,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 10:48:27,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:48:27,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 10:48:27,705 INFO L87 Difference]: Start difference. First operand 5352 states and 6603 transitions. Second operand 4 states. [2018-11-18 10:48:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:48:27,831 INFO L93 Difference]: Finished difference Result 5861 states and 7241 transitions. [2018-11-18 10:48:27,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 10:48:27,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2018-11-18 10:48:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:48:27,833 INFO L225 Difference]: With dead ends: 5861 [2018-11-18 10:48:27,833 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:48:27,837 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:48:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:48:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:48:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:48:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:48:27,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 463 [2018-11-18 10:48:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:48:27,839 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:48:27,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 10:48:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:48:27,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:48:27,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:48:27,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:27,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,397 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 454 DAG size of output: 88 [2018-11-18 10:48:28,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 10:48:28,669 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-11-18 10:48:28,968 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 19 [2018-11-18 10:48:29,385 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2018-11-18 10:48:29,550 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-18 10:48:29,550 INFO L421 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-18 10:48:29,550 INFO L428 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-11-18 10:48:29,550 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L421 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0) (and (<= ssl3_connect_~blastFlag~0 4) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (< |ssl3_connect_#in~initial_state| 12292))) [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L421 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-11-18 10:48:29,551 INFO L425 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L421 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-11-18 10:48:29,552 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L421 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1) (< |ssl3_connect_#in~initial_state| 12292))) [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L421 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-11-18 10:48:29,553 INFO L421 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-18 10:48:29,553 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L421 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 3)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse6 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1) (and (= ssl3_connect_~s__state~0 4464) .cse2 .cse3) (and .cse4 .cse0 .cse5) (and .cse0 .cse2) (and .cse6 .cse2 .cse3) (and .cse5 .cse7 .cse2 .cse8 .cse3 .cse9) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse7 .cse8) (and .cse5 .cse10 .cse11 .cse2 .cse3 .cse9) (and .cse2 .cse3 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse4 .cse5 .cse3) (and (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (< |ssl3_connect_#in~initial_state| 12292) (and .cse1 .cse3 .cse2) (and .cse0 .cse6))) [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-11-18 10:48:29,554 INFO L421 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_connect_~s__hit~0 0) .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1))) [2018-11-18 10:48:29,555 INFO L421 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-11-18 10:48:29,555 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-11-18 10:48:29,556 INFO L421 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse3) (and .cse4 .cse0 .cse2))) [2018-11-18 10:48:29,556 INFO L421 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-11-18 10:48:29,557 INFO L421 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse3 .cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and .cse1 .cse2 (<= ssl3_connect_~blastFlag~0 4) .cse3 .cse4))) [2018-11-18 10:48:29,557 INFO L421 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse1 .cse0 .cse2))) [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 533) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 75 545) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L428 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-11-18 10:48:29,558 INFO L421 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-18 10:48:29,558 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L421 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2018-11-18 10:48:29,559 INFO L421 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-11-18 10:48:29,559 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:48:29,559 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:48:29,559 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:48:29,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:48:29,560 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-11-18 10:48:29,560 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-11-18 10:48:29,560 INFO L428 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-11-18 10:48:29,560 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-11-18 10:48:29,560 INFO L425 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-11-18 10:48:29,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:48:29 BoogieIcfgContainer [2018-11-18 10:48:29,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:48:29,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:48:29,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:48:29,591 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:48:29,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:48:15" (3/4) ... [2018-11-18 10:48:29,594 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:48:29,599 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:48:29,599 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-18 10:48:29,600 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:48:29,605 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-18 10:48:29,605 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 10:48:29,605 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:48:29,623 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292 [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 10:48:29,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((256 == s__s3__tmp__new_cipher__algorithms && s__state <= 4560) && s__hit == 0) && 4464 <= s__state) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-11-18 10:48:29,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || \old(initial_state) < 12292 [2018-11-18 10:48:29,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-11-18 10:48:29,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) [2018-11-18 10:48:29,626 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(initial_state) < 12292 || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-11-18 10:48:29,673 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_896a554e-a854-46b6-a553-219d4356f902/bin-2019/utaipan/witness.graphml [2018-11-18 10:48:29,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:48:29,674 INFO L168 Benchmark]: Toolchain (without parser) took 14660.61 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 959.1 MB in the beginning and 1.7 GB in the end (delta: -764.8 MB). Peak memory consumption was 483.6 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,675 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:48:29,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,676 INFO L168 Benchmark]: Boogie Preprocessor took 33.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,677 INFO L168 Benchmark]: RCFGBuilder took 465.67 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,677 INFO L168 Benchmark]: TraceAbstraction took 13792.90 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -662.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,677 INFO L168 Benchmark]: Witness Printer took 82.57 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-18 10:48:29,679 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.81 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.67 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13792.90 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -662.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 82.57 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((256 == s__s3__tmp__new_cipher__algorithms && s__state <= 4560) && s__hit == 0) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((blastFlag <= 2 && s__state == 4528) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state == 4512 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((blastFlag <= 0 || (blastFlag <= 2 && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || \old(initial_state) < 12292 - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((\old(initial_state) < 12292 || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((blastFlag <= 2 && 12292 <= s__state) && s__hit == 0)) || (((12292 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0)) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state)) || \old(initial_state) < 12292 - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5372 SDtfs, 1897 SDslu, 3019 SDs, 0 SdLazy, 2527 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4445 GetRequests, 4397 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14986occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 5471 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 505 NumberOfFragments, 750 HoareAnnotationTreeSize, 26 FomulaSimplifications, 40323 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 26 FomulaSimplificationsInter, 4464 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 7764 NumberOfCodeBlocks, 7485 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 9906 ConstructedInterpolants, 0 QuantifiedInterpolants, 4398662 SizeOfPredicates, 11 NumberOfNonLiveVariables, 3682 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 34629/34780 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...