./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/config/AutomizerReach.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_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer --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 Automizer --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-635dfa2 [2018-12-02 04:56:54,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:56:54,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:56:54,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:56:54,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:56:54,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:56:54,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:56:54,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:56:54,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:56:54,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:56:54,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:56:54,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:56:54,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:56:54,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:56:54,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:56:54,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:56:54,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:56:54,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:56:54,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:56:54,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:56:54,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:56:54,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:56:54,543 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:56:54,543 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:56:54,543 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:56:54,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:56:54,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:56:54,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:56:54,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:56:54,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:56:54,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:56:54,546 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:56:54,546 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:56:54,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:56:54,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:56:54,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:56:54,547 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 04:56:54,554 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:56:54,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:56:54,555 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:56:54,555 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:56:54,555 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 04:56:54,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 04:56:54,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:56:54,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:56:54,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:56:54,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:56:54,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 04:56:54,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:56:54,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:56:54,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer 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 -> Automizer 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-12-02 04:56:54,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:56:54,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:56:54,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:56:54,588 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:56:54,588 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:56:54,588 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 04:56:54,629 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/data/d79af5702/a2b4e9d81f6541de801090bb6322067d/FLAG3425d5a40 [2018-12-02 04:56:55,115 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:56:55,116 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 04:56:55,123 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/data/d79af5702/a2b4e9d81f6541de801090bb6322067d/FLAG3425d5a40 [2018-12-02 04:56:55,610 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/data/d79af5702/a2b4e9d81f6541de801090bb6322067d [2018-12-02 04:56:55,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:56:55,613 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:56:55,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:56:55,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:56:55,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:56:55,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643265e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55, skipping insertion in model container [2018-12-02 04:56:55,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:56:55,656 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:56:55,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:56:55,782 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:56:55,813 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:56:55,853 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:56:55,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55 WrapperNode [2018-12-02 04:56:55,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:56:55,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:56:55,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:56:55,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:56:55,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,873 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:56:55,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:56:55,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:56:55,874 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:56:55,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... [2018-12-02 04:56:55,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:56:55,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:56:55,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:56:55,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:56:55,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/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-12-02 04:56:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:56:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:56:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-02 04:56:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-02 04:56:55,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:56:55,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:56:55,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:56:55,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:56:56,003 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 04:56:56,003 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 04:56:56,215 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:56:56,215 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 04:56:56,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:56 BoogieIcfgContainer [2018-12-02 04:56:56,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:56:56,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:56:56,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:56:56,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:56:56,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:56:55" (1/3) ... [2018-12-02 04:56:56,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d81e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:56:56, skipping insertion in model container [2018-12-02 04:56:56,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:56:55" (2/3) ... [2018-12-02 04:56:56,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d81e61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:56:56, skipping insertion in model container [2018-12-02 04:56:56,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:56" (3/3) ... [2018-12-02 04:56:56,220 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-12-02 04:56:56,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:56:56,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:56:56,240 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:56:56,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 04:56:56,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:56:56,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:56:56,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:56:56,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:56:56,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:56:56,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:56:56,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:56:56,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:56:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-12-02 04:56:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 04:56:56,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:56,277 INFO L402 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] [2018-12-02 04:56:56,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2018-12-02 04:56:56,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:56,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:56,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:56,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:56,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:56,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:56,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:56,422 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-12-02 04:56:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:56,486 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2018-12-02 04:56:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:56,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 04:56:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:56,496 INFO L225 Difference]: With dead ends: 374 [2018-12-02 04:56:56,496 INFO L226 Difference]: Without dead ends: 218 [2018-12-02 04:56:56,499 INFO L631 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-12-02 04:56:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-02 04:56:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-12-02 04:56:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-12-02 04:56:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2018-12-02 04:56:56,536 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2018-12-02 04:56:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:56,536 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2018-12-02 04:56:56,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2018-12-02 04:56:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 04:56:56,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:56,538 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:56,538 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:56,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2018-12-02 04:56:56,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:56,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:56,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:56,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 04:56:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:56,587 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2018-12-02 04:56:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:56,686 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2018-12-02 04:56:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:56,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-02 04:56:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:56,688 INFO L225 Difference]: With dead ends: 466 [2018-12-02 04:56:56,688 INFO L226 Difference]: Without dead ends: 260 [2018-12-02 04:56:56,689 INFO L631 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-12-02 04:56:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-02 04:56:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2018-12-02 04:56:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-12-02 04:56:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2018-12-02 04:56:56,704 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2018-12-02 04:56:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:56,704 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2018-12-02 04:56:56,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2018-12-02 04:56:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 04:56:56,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:56,705 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:56,706 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:56,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2018-12-02 04:56:56,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 04:56:56,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:56,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:56,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:56,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:56,753 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2018-12-02 04:56:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:56,854 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2018-12-02 04:56:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:56,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 04:56:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:56,855 INFO L225 Difference]: With dead ends: 594 [2018-12-02 04:56:56,855 INFO L226 Difference]: Without dead ends: 352 [2018-12-02 04:56:56,856 INFO L631 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-12-02 04:56:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-02 04:56:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2018-12-02 04:56:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-12-02 04:56:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2018-12-02 04:56:56,866 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2018-12-02 04:56:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:56,866 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2018-12-02 04:56:56,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2018-12-02 04:56:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 04:56:56,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:56,868 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:56,868 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:56,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2018-12-02 04:56:56,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 04:56:56,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:56,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:56,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:56,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:56,896 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2018-12-02 04:56:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:56,990 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2018-12-02 04:56:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:56,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-02 04:56:56,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:56,991 INFO L225 Difference]: With dead ends: 702 [2018-12-02 04:56:56,991 INFO L226 Difference]: Without dead ends: 380 [2018-12-02 04:56:56,992 INFO L631 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-12-02 04:56:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-02 04:56:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2018-12-02 04:56:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-02 04:56:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2018-12-02 04:56:57,000 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2018-12-02 04:56:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,000 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2018-12-02 04:56:57,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2018-12-02 04:56:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 04:56:57,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,002 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,002 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2018-12-02 04:56:57,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 04:56:57,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,029 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2018-12-02 04:56:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,132 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2018-12-02 04:56:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-02 04:56:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,134 INFO L225 Difference]: With dead ends: 838 [2018-12-02 04:56:57,134 INFO L226 Difference]: Without dead ends: 476 [2018-12-02 04:56:57,134 INFO L631 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-12-02 04:56:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-12-02 04:56:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2018-12-02 04:56:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 04:56:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2018-12-02 04:56:57,144 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2018-12-02 04:56:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,144 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2018-12-02 04:56:57,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2018-12-02 04:56:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 04:56:57,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,145 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,145 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2018-12-02 04:56:57,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-02 04:56:57,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,172 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2018-12-02 04:56:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,241 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2018-12-02 04:56:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-02 04:56:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,243 INFO L225 Difference]: With dead ends: 936 [2018-12-02 04:56:57,243 INFO L226 Difference]: Without dead ends: 498 [2018-12-02 04:56:57,244 INFO L631 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-12-02 04:56:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-02 04:56:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2018-12-02 04:56:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-12-02 04:56:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2018-12-02 04:56:57,258 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2018-12-02 04:56:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,259 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2018-12-02 04:56:57,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2018-12-02 04:56:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 04:56:57,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,261 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2018-12-02 04:56:57,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-02 04:56:57,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,293 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2018-12-02 04:56:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,325 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2018-12-02 04:56:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-12-02 04:56:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,328 INFO L225 Difference]: With dead ends: 972 [2018-12-02 04:56:57,328 INFO L226 Difference]: Without dead ends: 731 [2018-12-02 04:56:57,329 INFO L631 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-12-02 04:56:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-12-02 04:56:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2018-12-02 04:56:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-12-02 04:56:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2018-12-02 04:56:57,349 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2018-12-02 04:56:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,349 INFO L480 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2018-12-02 04:56:57,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2018-12-02 04:56:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 04:56:57,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,362 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,362 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2018-12-02 04:56:57,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 04:56:57,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,394 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2018-12-02 04:56:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,433 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2018-12-02 04:56:57,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-02 04:56:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,435 INFO L225 Difference]: With dead ends: 972 [2018-12-02 04:56:57,435 INFO L226 Difference]: Without dead ends: 970 [2018-12-02 04:56:57,436 INFO L631 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-12-02 04:56:57,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-02 04:56:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2018-12-02 04:56:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-12-02 04:56:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2018-12-02 04:56:57,449 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2018-12-02 04:56:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,449 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2018-12-02 04:56:57,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2018-12-02 04:56:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 04:56:57,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,450 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,450 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2018-12-02 04:56:57,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,472 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-02 04:56:57,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,473 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2018-12-02 04:56:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,551 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2018-12-02 04:56:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-12-02 04:56:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,554 INFO L225 Difference]: With dead ends: 2034 [2018-12-02 04:56:57,554 INFO L226 Difference]: Without dead ends: 1076 [2018-12-02 04:56:57,555 INFO L631 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-12-02 04:56:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2018-12-02 04:56:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2018-12-02 04:56:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-12-02 04:56:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2018-12-02 04:56:57,569 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2018-12-02 04:56:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,569 INFO L480 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2018-12-02 04:56:57,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2018-12-02 04:56:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 04:56:57,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,571 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2018-12-02 04:56:57,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 04:56:57,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,601 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2018-12-02 04:56:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,699 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2018-12-02 04:56:57,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2018-12-02 04:56:57,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,703 INFO L225 Difference]: With dead ends: 2316 [2018-12-02 04:56:57,703 INFO L226 Difference]: Without dead ends: 1258 [2018-12-02 04:56:57,705 INFO L631 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-12-02 04:56:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2018-12-02 04:56:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2018-12-02 04:56:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2018-12-02 04:56:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2018-12-02 04:56:57,726 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2018-12-02 04:56:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,726 INFO L480 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2018-12-02 04:56:57,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2018-12-02 04:56:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 04:56:57,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,728 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,728 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2018-12-02 04:56:57,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 04:56:57,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,764 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2018-12-02 04:56:57,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:57,855 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2018-12-02 04:56:57,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:57,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-02 04:56:57,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:57,859 INFO L225 Difference]: With dead ends: 2544 [2018-12-02 04:56:57,859 INFO L226 Difference]: Without dead ends: 1338 [2018-12-02 04:56:57,861 INFO L631 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-12-02 04:56:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2018-12-02 04:56:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2018-12-02 04:56:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-12-02 04:56:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2018-12-02 04:56:57,888 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2018-12-02 04:56:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:57,888 INFO L480 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2018-12-02 04:56:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2018-12-02 04:56:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 04:56:57,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:57,891 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:57,892 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2018-12-02 04:56:57,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 04:56:57,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:57,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:57,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:57,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:57,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:57,930 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2018-12-02 04:56:58,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:58,026 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2018-12-02 04:56:58,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:58,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2018-12-02 04:56:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:58,031 INFO L225 Difference]: With dead ends: 2784 [2018-12-02 04:56:58,031 INFO L226 Difference]: Without dead ends: 1466 [2018-12-02 04:56:58,034 INFO L631 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-12-02 04:56:58,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-02 04:56:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2018-12-02 04:56:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2018-12-02 04:56:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2018-12-02 04:56:58,069 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2018-12-02 04:56:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:58,069 INFO L480 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2018-12-02 04:56:58,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2018-12-02 04:56:58,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 04:56:58,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:58,072 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:58,072 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:58,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2018-12-02 04:56:58,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:58,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:58,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-12-02 04:56:58,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:58,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:58,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:58,144 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2018-12-02 04:56:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:58,171 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2018-12-02 04:56:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:58,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-02 04:56:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:58,176 INFO L225 Difference]: With dead ends: 4334 [2018-12-02 04:56:58,176 INFO L226 Difference]: Without dead ends: 2892 [2018-12-02 04:56:58,178 INFO L631 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-12-02 04:56:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2018-12-02 04:56:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2018-12-02 04:56:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-02 04:56:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2018-12-02 04:56:58,214 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2018-12-02 04:56:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:58,215 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2018-12-02 04:56:58,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2018-12-02 04:56:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 04:56:58,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:58,218 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:58,218 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:58,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2018-12-02 04:56:58,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:58,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:58,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-12-02 04:56:58,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:58,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:58,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:58,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:58,254 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2018-12-02 04:56:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:58,362 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2018-12-02 04:56:58,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:58,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-02 04:56:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:58,367 INFO L225 Difference]: With dead ends: 6068 [2018-12-02 04:56:58,368 INFO L226 Difference]: Without dead ends: 3190 [2018-12-02 04:56:58,370 INFO L631 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-12-02 04:56:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2018-12-02 04:56:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2018-12-02 04:56:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2018-12-02 04:56:58,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2018-12-02 04:56:58,407 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2018-12-02 04:56:58,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:58,407 INFO L480 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2018-12-02 04:56:58,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2018-12-02 04:56:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-02 04:56:58,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:58,411 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:58,411 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:58,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2018-12-02 04:56:58,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:58,458 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-02 04:56:58,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:58,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:58,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:58,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:58,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:58,459 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2018-12-02 04:56:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:58,554 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2018-12-02 04:56:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:58,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-12-02 04:56:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:58,563 INFO L225 Difference]: With dead ends: 6484 [2018-12-02 04:56:58,563 INFO L226 Difference]: Without dead ends: 3322 [2018-12-02 04:56:58,566 INFO L631 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-12-02 04:56:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2018-12-02 04:56:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2018-12-02 04:56:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-12-02 04:56:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2018-12-02 04:56:58,601 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2018-12-02 04:56:58,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:58,601 INFO L480 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2018-12-02 04:56:58,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2018-12-02 04:56:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-12-02 04:56:58,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:58,605 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:58,605 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:58,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2018-12-02 04:56:58,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:58,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-02 04:56:58,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:58,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:58,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:58,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:58,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:58,652 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2018-12-02 04:56:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:58,780 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2018-12-02 04:56:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:58,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2018-12-02 04:56:58,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:58,788 INFO L225 Difference]: With dead ends: 7000 [2018-12-02 04:56:58,788 INFO L226 Difference]: Without dead ends: 3706 [2018-12-02 04:56:58,791 INFO L631 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-12-02 04:56:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2018-12-02 04:56:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2018-12-02 04:56:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2018-12-02 04:56:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2018-12-02 04:56:58,840 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2018-12-02 04:56:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:58,841 INFO L480 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2018-12-02 04:56:58,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2018-12-02 04:56:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-02 04:56:58,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:58,855 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:58,855 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:58,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2018-12-02 04:56:58,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:58,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-02 04:56:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:58,894 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2018-12-02 04:56:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:59,023 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2018-12-02 04:56:59,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:59,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2018-12-02 04:56:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:59,031 INFO L225 Difference]: With dead ends: 7632 [2018-12-02 04:56:59,032 INFO L226 Difference]: Without dead ends: 4026 [2018-12-02 04:56:59,036 INFO L631 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-12-02 04:56:59,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2018-12-02 04:56:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2018-12-02 04:56:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2018-12-02 04:56:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2018-12-02 04:56:59,076 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2018-12-02 04:56:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:59,076 INFO L480 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2018-12-02 04:56:59,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2018-12-02 04:56:59,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-02 04:56:59,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:59,080 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:59,080 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:59,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:59,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2018-12-02 04:56:59,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:59,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:59,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:59,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-02 04:56:59,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:59,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:59,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:59,156 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2018-12-02 04:56:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:59,206 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2018-12-02 04:56:59,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:59,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2018-12-02 04:56:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:59,215 INFO L225 Difference]: With dead ends: 10686 [2018-12-02 04:56:59,215 INFO L226 Difference]: Without dead ends: 6960 [2018-12-02 04:56:59,219 INFO L631 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-12-02 04:56:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2018-12-02 04:56:59,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2018-12-02 04:56:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2018-12-02 04:56:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2018-12-02 04:56:59,285 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2018-12-02 04:56:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:59,286 INFO L480 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2018-12-02 04:56:59,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2018-12-02 04:56:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-02 04:56:59,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:59,292 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:59,292 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2018-12-02 04:56:59,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-12-02 04:56:59,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:56:59,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:56:59,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:56:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:56:59,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:56:59,343 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2018-12-02 04:56:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:56:59,479 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2018-12-02 04:56:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:56:59,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-12-02 04:56:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:56:59,487 INFO L225 Difference]: With dead ends: 13912 [2018-12-02 04:56:59,487 INFO L226 Difference]: Without dead ends: 6966 [2018-12-02 04:56:59,492 INFO L631 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-12-02 04:56:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2018-12-02 04:56:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2018-12-02 04:56:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2018-12-02 04:56:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2018-12-02 04:56:59,553 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2018-12-02 04:56:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:56:59,554 INFO L480 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2018-12-02 04:56:59,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:56:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2018-12-02 04:56:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 04:56:59,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:56:59,558 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:56:59,559 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:56:59,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:56:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2018-12-02 04:56:59,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:56:59,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:56:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:56:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-02 04:56:59,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:56:59,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/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-12-02 04:56:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:56:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:56:59,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:56:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2018-12-02 04:56:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:56:59,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-12-02 04:56:59,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 04:56:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 04:56:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 04:56:59,736 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 6 states. [2018-12-02 04:57:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:00,139 INFO L93 Difference]: Finished difference Result 17368 states and 22742 transitions. [2018-12-02 04:57:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:57:00,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-12-02 04:57:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:00,150 INFO L225 Difference]: With dead ends: 17368 [2018-12-02 04:57:00,150 INFO L226 Difference]: Without dead ends: 10410 [2018-12-02 04:57:00,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-02 04:57:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2018-12-02 04:57:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2018-12-02 04:57:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2018-12-02 04:57:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2018-12-02 04:57:00,326 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 284 [2018-12-02 04:57:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:00,326 INFO L480 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2018-12-02 04:57:00,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 04:57:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2018-12-02 04:57:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-02 04:57:00,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:00,337 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:57:00,337 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:00,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 1 times [2018-12-02 04:57:00,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:57:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:57:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2018-12-02 04:57:00,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:57:00,461 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/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-12-02 04:57:00,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:00,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:57:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2018-12-02 04:57:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 04:57:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-02 04:57:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:57:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:57:00,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:00,578 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 5 states. [2018-12-02 04:57:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:00,931 INFO L93 Difference]: Finished difference Result 20417 states and 26625 transitions. [2018-12-02 04:57:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:57:00,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2018-12-02 04:57:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:00,948 INFO L225 Difference]: With dead ends: 20417 [2018-12-02 04:57:00,948 INFO L226 Difference]: Without dead ends: 11583 [2018-12-02 04:57:00,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:57:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2018-12-02 04:57:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 9674. [2018-12-02 04:57:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2018-12-02 04:57:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 12389 transitions. [2018-12-02 04:57:01,101 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 12389 transitions. Word has length 310 [2018-12-02 04:57:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:01,102 INFO L480 AbstractCegarLoop]: Abstraction has 9674 states and 12389 transitions. [2018-12-02 04:57:01,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:57:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 12389 transitions. [2018-12-02 04:57:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-12-02 04:57:01,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:01,109 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 04:57:01,109 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:01,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1592916915, now seen corresponding path program 1 times [2018-12-02 04:57:01,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:57:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:57:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-12-02 04:57:01,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:57:01,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:57:01,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:57:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:57:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:57:01,193 INFO L87 Difference]: Start difference. First operand 9674 states and 12389 transitions. Second operand 3 states. [2018-12-02 04:57:01,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:01,319 INFO L93 Difference]: Finished difference Result 18321 states and 23212 transitions. [2018-12-02 04:57:01,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:57:01,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2018-12-02 04:57:01,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:01,325 INFO L225 Difference]: With dead ends: 18321 [2018-12-02 04:57:01,325 INFO L226 Difference]: Without dead ends: 3877 [2018-12-02 04:57:01,334 INFO L631 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-12-02 04:57:01,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2018-12-02 04:57:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3536. [2018-12-02 04:57:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2018-12-02 04:57:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4402 transitions. [2018-12-02 04:57:01,370 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4402 transitions. Word has length 416 [2018-12-02 04:57:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:01,370 INFO L480 AbstractCegarLoop]: Abstraction has 3536 states and 4402 transitions. [2018-12-02 04:57:01,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:57:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4402 transitions. [2018-12-02 04:57:01,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-02 04:57:01,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:57:01,374 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 04:57:01,375 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:57:01,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:57:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2018-12-02 04:57:01,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 04:57:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 04:57:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:57:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-02 04:57:01,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 04:57:01,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/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-12-02 04:57:01,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:57:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:57:01,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 04:57:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2018-12-02 04:57:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 04:57:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-02 04:57:01,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:57:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:57:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:57:01,611 INFO L87 Difference]: Start difference. First operand 3536 states and 4402 transitions. Second operand 4 states. [2018-12-02 04:57:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:57:01,726 INFO L93 Difference]: Finished difference Result 4032 states and 5027 transitions. [2018-12-02 04:57:01,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:57:01,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2018-12-02 04:57:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:57:01,727 INFO L225 Difference]: With dead ends: 4032 [2018-12-02 04:57:01,727 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 04:57:01,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:57:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 04:57:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 04:57:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 04:57:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 04:57:01,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2018-12-02 04:57:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:57:01,732 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 04:57:01,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:57:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 04:57:01,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 04:57:01,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 04:57:01,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:01,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,099 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 68 [2018-12-02 04:57:02,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 04:57:02,537 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2018-12-02 04:57:02,609 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L444 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-02 04:57:02,609 INFO L451 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-12-02 04:57:02,609 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L444 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0))) [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L444 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-12-02 04:57:02,610 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L444 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L444 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 (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-12-02 04:57:02,611 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L444 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L444 ceAbstractionStarter]: At program point L149(lines 145 499) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2))) [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L444 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1) (and .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse4) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse5 .cse2) (and (= ssl3_connect_~s__state~0 4464) .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and .cse6 .cse3 .cse4 .cse2 .cse7) (and .cse6 .cse8 .cse2 .cse9 .cse7) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse8 .cse9) (and (<= ssl3_connect_~s__state~0 3) .cse6) (and .cse0 .cse5) (and .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-12-02 04:57:02,612 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L444 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_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-12-02 04:57:02,613 INFO L444 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse2 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse0 .cse1))) [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-02 04:57:02,613 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-12-02 04:57:02,614 INFO L448 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L444 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2))) [2018-12-02 04:57:02,615 INFO L444 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-12-02 04:57:02,615 INFO L448 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L444 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-12-02 04:57:02,616 INFO L444 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4464 ssl3_connect_~s__state~0))) [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-12-02 04:57:02,616 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L451 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-12-02 04:57:02,617 INFO L444 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-12-02 04:57:02,617 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-12-02 04:57:02,617 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L444 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2018-12-02 04:57:02,618 INFO L444 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0)))) [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 04:57:02,618 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L451 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-12-02 04:57:02,618 INFO L448 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-12-02 04:57:02,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:57:02 BoogieIcfgContainer [2018-12-02 04:57:02,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:57:02,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:57:02,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:57:02,636 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:57:02,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:56:56" (3/4) ... [2018-12-02 04:57:02,640 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 04:57:02,646 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 04:57:02,646 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-12-02 04:57:02,646 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 04:57:02,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-02 04:57:02,654 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 04:57:02,655 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 04:57:02,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) [2018-12-02 04:57:02,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) [2018-12-02 04:57:02,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) [2018-12-02 04:57:02,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-12-02 04:57:02,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-12-02 04:57:02,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-12-02 04:57:02,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || (s__state == 4512 && s__hit == 0)) || (s__state == 4464 && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 4 && s__hit == 0) [2018-12-02 04:57:02,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-12-02 04:57:02,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-12-02 04:57:02,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__state <= 4560 && s__hit == 0) && 4464 <= s__state) [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) [2018-12-02 04:57:02,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) [2018-12-02 04:57:02,675 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) [2018-12-02 04:57:02,715 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3488f2d-0077-4f14-beed-d185041db941/bin-2019/uautomizer/witness.graphml [2018-12-02 04:57:02,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:57:02,716 INFO L168 Benchmark]: Toolchain (without parser) took 7103.60 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 678.4 MB). Free memory was 956.0 MB in the beginning and 1.5 GB in the end (delta: -496.1 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,717 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:57:02,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,718 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:57:02,718 INFO L168 Benchmark]: RCFGBuilder took 319.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,718 INFO L168 Benchmark]: TraceAbstraction took 6420.16 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 568.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -414.7 MB). Peak memory consumption was 859.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,718 INFO L168 Benchmark]: Witness Printer took 79.40 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:57:02,720 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 319.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6420.16 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 568.9 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -414.7 MB). Peak memory consumption was 859.7 MB. Max. memory is 11.5 GB. * Witness Printer took 79.40 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 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 || ((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: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || (s__state == 4512 && s__hit == 0)) || (s__state == 4464 && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (((s__s3__tmp__next_state___0 <= 4560 && 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 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 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)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 137 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4657 SDtfs, 1854 SDslu, 2919 SDs, 0 SdLazy, 2715 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9674occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 4400 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 341 NumberOfFragments, 518 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21934 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 909 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 5339 NumberOfCodeBlocks, 5339 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856425 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1970 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 15819/15870 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...