./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72fcebcfa7a668c9bb314320ec142761ff8c6a6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:51:00,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:51:00,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:51:00,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:51:00,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:51:00,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:51:00,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:51:00,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:51:00,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:51:00,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:51:00,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:51:00,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:51:00,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:51:00,743 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:51:00,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:51:00,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:51:00,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:51:00,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:51:00,748 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:51:00,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:51:00,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:51:00,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:51:00,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:51:00,753 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:51:00,754 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:51:00,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:51:00,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:51:00,756 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:51:00,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:51:00,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:51:00,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:51:00,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:51:00,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:51:00,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:51:00,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:51:00,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:51:00,761 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:51:00,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:51:00,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:51:00,772 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:51:00,772 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:51:00,772 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:51:00,773 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:51:00,773 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:51:00,773 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:51:00,773 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:51:00,773 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:51:00,773 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:51:00,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:51:00,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:51:00,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:51:00,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:51:00,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:51:00,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:51:00,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:51:00,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:51:00,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:51:00,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:51:00,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:51:00,777 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2018-10-26 19:51:00,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:51:00,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:51:00,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:51:00,824 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:51:00,825 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:51:00,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-26 19:51:00,874 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/data/dfacafc3e/079934dde1fc4331add738c6b7fd0a8f/FLAGb9677e9df [2018-10-26 19:51:01,300 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:51:01,302 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-26 19:51:01,312 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/data/dfacafc3e/079934dde1fc4331add738c6b7fd0a8f/FLAGb9677e9df [2018-10-26 19:51:01,326 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/data/dfacafc3e/079934dde1fc4331add738c6b7fd0a8f [2018-10-26 19:51:01,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:51:01,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:51:01,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:51:01,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:51:01,334 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:51:01,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570cef64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01, skipping insertion in model container [2018-10-26 19:51:01,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:51:01,378 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:51:01,607 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:51:01,610 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:51:01,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:51:01,686 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:51:01,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01 WrapperNode [2018-10-26 19:51:01,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:51:01,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:51:01,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:51:01,688 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:51:01,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:51:01,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:51:01,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:51:01,717 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:51:01,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... [2018-10-26 19:51:01,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:51:01,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:51:01,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:51:01,762 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:51:01,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:51:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:51:01,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:51:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:51:01,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:51:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 19:51:01,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 19:51:01,879 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:51:01,879 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:51:02,044 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 19:51:02,044 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 19:51:02,697 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:51:02,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:02 BoogieIcfgContainer [2018-10-26 19:51:02,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:51:02,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:51:02,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:51:02,703 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:51:02,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:51:01" (1/3) ... [2018-10-26 19:51:02,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1682bddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:51:02, skipping insertion in model container [2018-10-26 19:51:02,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:51:01" (2/3) ... [2018-10-26 19:51:02,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1682bddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:51:02, skipping insertion in model container [2018-10-26 19:51:02,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:02" (3/3) ... [2018-10-26 19:51:02,706 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-26 19:51:02,714 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:51:02,720 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:51:02,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:51:02,768 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:51:02,768 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:51:02,768 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:51:02,768 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:51:02,768 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:51:02,770 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:51:02,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:51:02,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:51:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-10-26 19:51:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:51:02,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:02,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:02,805 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:02,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:02,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1681834572, now seen corresponding path program 1 times [2018-10-26 19:51:02,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:02,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:02,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:02,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:02,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:03,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:03,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:03,001 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:03,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:03,020 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-10-26 19:51:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:03,205 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-10-26 19:51:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:03,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:51:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:03,218 INFO L225 Difference]: With dead ends: 377 [2018-10-26 19:51:03,218 INFO L226 Difference]: Without dead ends: 220 [2018-10-26 19:51:03,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-26 19:51:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-10-26 19:51:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-26 19:51:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-10-26 19:51:03,269 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 30 [2018-10-26 19:51:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:03,269 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-10-26 19:51:03,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-10-26 19:51:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:51:03,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:03,271 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:03,272 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:03,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -770623058, now seen corresponding path program 1 times [2018-10-26 19:51:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:03,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:03,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:03,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:03,273 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:03,355 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:03,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:03,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:03,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:03,357 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-10-26 19:51:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:03,868 INFO L93 Difference]: Finished difference Result 472 states and 709 transitions. [2018-10-26 19:51:03,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:03,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 19:51:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:03,870 INFO L225 Difference]: With dead ends: 472 [2018-10-26 19:51:03,870 INFO L226 Difference]: Without dead ends: 264 [2018-10-26 19:51:03,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-26 19:51:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-10-26 19:51:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-26 19:51:03,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2018-10-26 19:51:03,890 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 45 [2018-10-26 19:51:03,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:03,890 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2018-10-26 19:51:03,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2018-10-26 19:51:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:51:03,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:03,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:03,893 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:03,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 304748371, now seen corresponding path program 1 times [2018-10-26 19:51:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:03,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:03,894 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:51:03,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:03,967 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:03,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:03,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:03,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:03,968 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand 3 states. [2018-10-26 19:51:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:04,024 INFO L93 Difference]: Finished difference Result 401 states and 582 transitions. [2018-10-26 19:51:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:04,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:51:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:04,028 INFO L225 Difference]: With dead ends: 401 [2018-10-26 19:51:04,028 INFO L226 Difference]: Without dead ends: 278 [2018-10-26 19:51:04,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-26 19:51:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-26 19:51:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-26 19:51:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 400 transitions. [2018-10-26 19:51:04,045 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 400 transitions. Word has length 63 [2018-10-26 19:51:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:04,046 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 400 transitions. [2018-10-26 19:51:04,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 400 transitions. [2018-10-26 19:51:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:51:04,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:04,048 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:04,049 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:04,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash 242708757, now seen corresponding path program 1 times [2018-10-26 19:51:04,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:51:04,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:04,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:04,156 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:04,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:04,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:04,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,157 INFO L87 Difference]: Start difference. First operand 278 states and 400 transitions. Second operand 3 states. [2018-10-26 19:51:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:04,487 INFO L93 Difference]: Finished difference Result 648 states and 964 transitions. [2018-10-26 19:51:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:04,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:51:04,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:04,492 INFO L225 Difference]: With dead ends: 648 [2018-10-26 19:51:04,493 INFO L226 Difference]: Without dead ends: 380 [2018-10-26 19:51:04,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-26 19:51:04,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 362. [2018-10-26 19:51:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-26 19:51:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 502 transitions. [2018-10-26 19:51:04,521 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 502 transitions. Word has length 63 [2018-10-26 19:51:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:04,522 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 502 transitions. [2018-10-26 19:51:04,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 502 transitions. [2018-10-26 19:51:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:51:04,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:04,525 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:04,525 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 108695251, now seen corresponding path program 1 times [2018-10-26 19:51:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:04,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:04,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,534 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:51:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:04,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:04,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,668 INFO L87 Difference]: Start difference. First operand 362 states and 502 transitions. Second operand 3 states. [2018-10-26 19:51:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:04,829 INFO L93 Difference]: Finished difference Result 760 states and 1069 transitions. [2018-10-26 19:51:04,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:04,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:51:04,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:04,834 INFO L225 Difference]: With dead ends: 760 [2018-10-26 19:51:04,835 INFO L226 Difference]: Without dead ends: 410 [2018-10-26 19:51:04,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-26 19:51:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 402. [2018-10-26 19:51:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-26 19:51:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 552 transitions. [2018-10-26 19:51:04,850 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 552 transitions. Word has length 63 [2018-10-26 19:51:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:04,850 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 552 transitions. [2018-10-26 19:51:04,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 552 transitions. [2018-10-26 19:51:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 19:51:04,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:04,853 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:04,853 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:04,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash 991863066, now seen corresponding path program 1 times [2018-10-26 19:51:04,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:04,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:04,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:04,855 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:51:04,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:04,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:04,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:04,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:04,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:04,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:04,924 INFO L87 Difference]: Start difference. First operand 402 states and 552 transitions. Second operand 3 states. [2018-10-26 19:51:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:05,227 INFO L93 Difference]: Finished difference Result 900 states and 1274 transitions. [2018-10-26 19:51:05,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:05,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-26 19:51:05,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:05,232 INFO L225 Difference]: With dead ends: 900 [2018-10-26 19:51:05,233 INFO L226 Difference]: Without dead ends: 508 [2018-10-26 19:51:05,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-10-26 19:51:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 482. [2018-10-26 19:51:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-10-26 19:51:05,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 688 transitions. [2018-10-26 19:51:05,248 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 688 transitions. Word has length 77 [2018-10-26 19:51:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:05,248 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 688 transitions. [2018-10-26 19:51:05,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:05,249 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 688 transitions. [2018-10-26 19:51:05,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:51:05,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:05,250 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:05,251 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:05,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash 108077882, now seen corresponding path program 1 times [2018-10-26 19:51:05,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:05,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:05,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:05,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 19:51:05,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:05,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:05,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:05,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:05,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:05,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:05,334 INFO L87 Difference]: Start difference. First operand 482 states and 688 transitions. Second operand 3 states. [2018-10-26 19:51:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:06,167 INFO L93 Difference]: Finished difference Result 1002 states and 1439 transitions. [2018-10-26 19:51:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:06,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-26 19:51:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:06,169 INFO L225 Difference]: With dead ends: 1002 [2018-10-26 19:51:06,169 INFO L226 Difference]: Without dead ends: 532 [2018-10-26 19:51:06,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-10-26 19:51:06,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 526. [2018-10-26 19:51:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-10-26 19:51:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 742 transitions. [2018-10-26 19:51:06,188 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 742 transitions. Word has length 80 [2018-10-26 19:51:06,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:06,189 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 742 transitions. [2018-10-26 19:51:06,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 742 transitions. [2018-10-26 19:51:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 19:51:06,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:06,191 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:06,191 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:06,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2102538991, now seen corresponding path program 1 times [2018-10-26 19:51:06,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,192 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 19:51:06,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:06,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:06,293 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:06,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:06,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:06,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:06,294 INFO L87 Difference]: Start difference. First operand 526 states and 742 transitions. Second operand 3 states. [2018-10-26 19:51:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:06,617 INFO L93 Difference]: Finished difference Result 1040 states and 1473 transitions. [2018-10-26 19:51:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:06,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-10-26 19:51:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:06,621 INFO L225 Difference]: With dead ends: 1040 [2018-10-26 19:51:06,621 INFO L226 Difference]: Without dead ends: 771 [2018-10-26 19:51:06,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-10-26 19:51:06,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 771. [2018-10-26 19:51:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2018-10-26 19:51:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1090 transitions. [2018-10-26 19:51:06,644 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1090 transitions. Word has length 101 [2018-10-26 19:51:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:06,644 INFO L481 AbstractCegarLoop]: Abstraction has 771 states and 1090 transitions. [2018-10-26 19:51:06,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1090 transitions. [2018-10-26 19:51:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 19:51:06,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:06,664 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:06,664 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:06,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -753441861, now seen corresponding path program 1 times [2018-10-26 19:51:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 19:51:06,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:06,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:06,758 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:06,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:06,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:06,759 INFO L87 Difference]: Start difference. First operand 771 states and 1090 transitions. Second operand 3 states. [2018-10-26 19:51:06,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:06,948 INFO L93 Difference]: Finished difference Result 1018 states and 1442 transitions. [2018-10-26 19:51:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:06,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-26 19:51:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:06,954 INFO L225 Difference]: With dead ends: 1018 [2018-10-26 19:51:06,954 INFO L226 Difference]: Without dead ends: 1016 [2018-10-26 19:51:06,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2018-10-26 19:51:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2018-10-26 19:51:06,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2018-10-26 19:51:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1440 transitions. [2018-10-26 19:51:06,980 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1440 transitions. Word has length 103 [2018-10-26 19:51:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:06,980 INFO L481 AbstractCegarLoop]: Abstraction has 1016 states and 1440 transitions. [2018-10-26 19:51:06,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1440 transitions. [2018-10-26 19:51:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 19:51:06,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:06,984 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:06,984 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:06,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:06,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1108325807, now seen corresponding path program 1 times [2018-10-26 19:51:06,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:06,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:06,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:06,987 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 19:51:07,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:07,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:07,091 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:07,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:07,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:07,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:07,092 INFO L87 Difference]: Start difference. First operand 1016 states and 1440 transitions. Second operand 3 states. [2018-10-26 19:51:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:07,229 INFO L93 Difference]: Finished difference Result 2130 states and 3038 transitions. [2018-10-26 19:51:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:07,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-10-26 19:51:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:07,238 INFO L225 Difference]: With dead ends: 2130 [2018-10-26 19:51:07,238 INFO L226 Difference]: Without dead ends: 1126 [2018-10-26 19:51:07,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2018-10-26 19:51:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1112. [2018-10-26 19:51:07,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2018-10-26 19:51:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1556 transitions. [2018-10-26 19:51:07,263 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1556 transitions. Word has length 129 [2018-10-26 19:51:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:07,264 INFO L481 AbstractCegarLoop]: Abstraction has 1112 states and 1556 transitions. [2018-10-26 19:51:07,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1556 transitions. [2018-10-26 19:51:07,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 19:51:07,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:07,267 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:07,268 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:07,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash -556662949, now seen corresponding path program 1 times [2018-10-26 19:51:07,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:07,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:07,269 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-26 19:51:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:07,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:07,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:07,377 INFO L87 Difference]: Start difference. First operand 1112 states and 1556 transitions. Second operand 3 states. [2018-10-26 19:51:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:07,566 INFO L93 Difference]: Finished difference Result 2424 states and 3444 transitions. [2018-10-26 19:51:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:07,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-26 19:51:07,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:07,575 INFO L225 Difference]: With dead ends: 2424 [2018-10-26 19:51:07,575 INFO L226 Difference]: Without dead ends: 1316 [2018-10-26 19:51:07,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:07,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2018-10-26 19:51:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1276. [2018-10-26 19:51:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-10-26 19:51:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1772 transitions. [2018-10-26 19:51:07,604 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1772 transitions. Word has length 151 [2018-10-26 19:51:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:07,604 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1772 transitions. [2018-10-26 19:51:07,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1772 transitions. [2018-10-26 19:51:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 19:51:07,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:07,608 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:07,609 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:07,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:07,609 INFO L82 PathProgramCache]: Analyzing trace with hash -422649443, now seen corresponding path program 1 times [2018-10-26 19:51:07,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:07,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:07,610 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-26 19:51:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:07,700 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:07,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:07,701 INFO L87 Difference]: Start difference. First operand 1276 states and 1772 transitions. Second operand 3 states. [2018-10-26 19:51:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:08,172 INFO L93 Difference]: Finished difference Result 2744 states and 3868 transitions. [2018-10-26 19:51:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:08,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-26 19:51:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:08,179 INFO L225 Difference]: With dead ends: 2744 [2018-10-26 19:51:08,180 INFO L226 Difference]: Without dead ends: 1472 [2018-10-26 19:51:08,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2018-10-26 19:51:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1400. [2018-10-26 19:51:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2018-10-26 19:51:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1932 transitions. [2018-10-26 19:51:08,213 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1932 transitions. Word has length 151 [2018-10-26 19:51:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:08,213 INFO L481 AbstractCegarLoop]: Abstraction has 1400 states and 1932 transitions. [2018-10-26 19:51:08,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:08,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1932 transitions. [2018-10-26 19:51:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 19:51:08,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:08,218 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:08,218 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:08,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:08,218 INFO L82 PathProgramCache]: Analyzing trace with hash 247849431, now seen corresponding path program 1 times [2018-10-26 19:51:08,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:08,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:08,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:08,219 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-26 19:51:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:08,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:08,289 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:08,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:08,290 INFO L87 Difference]: Start difference. First operand 1400 states and 1932 transitions. Second operand 3 states. [2018-10-26 19:51:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:08,441 INFO L93 Difference]: Finished difference Result 2928 states and 4016 transitions. [2018-10-26 19:51:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:08,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-26 19:51:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:08,448 INFO L225 Difference]: With dead ends: 2928 [2018-10-26 19:51:08,448 INFO L226 Difference]: Without dead ends: 1540 [2018-10-26 19:51:08,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:08,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2018-10-26 19:51:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1528. [2018-10-26 19:51:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2018-10-26 19:51:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2080 transitions. [2018-10-26 19:51:08,488 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2080 transitions. Word has length 188 [2018-10-26 19:51:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:08,489 INFO L481 AbstractCegarLoop]: Abstraction has 1528 states and 2080 transitions. [2018-10-26 19:51:08,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2080 transitions. [2018-10-26 19:51:08,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 19:51:08,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:08,494 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:08,494 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:08,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1713725227, now seen corresponding path program 1 times [2018-10-26 19:51:08,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:08,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:08,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:08,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:08,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-26 19:51:08,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:08,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:08,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:08,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:08,621 INFO L87 Difference]: Start difference. First operand 1528 states and 2080 transitions. Second operand 3 states. [2018-10-26 19:51:09,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:09,123 INFO L93 Difference]: Finished difference Result 3040 states and 4128 transitions. [2018-10-26 19:51:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:09,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-26 19:51:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:09,127 INFO L225 Difference]: With dead ends: 3040 [2018-10-26 19:51:09,127 INFO L226 Difference]: Without dead ends: 1524 [2018-10-26 19:51:09,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2018-10-26 19:51:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1516. [2018-10-26 19:51:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2018-10-26 19:51:09,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2052 transitions. [2018-10-26 19:51:09,156 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2052 transitions. Word has length 188 [2018-10-26 19:51:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:09,156 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 2052 transitions. [2018-10-26 19:51:09,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2052 transitions. [2018-10-26 19:51:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 19:51:09,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:09,162 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:09,162 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:09,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:09,162 INFO L82 PathProgramCache]: Analyzing trace with hash 291965960, now seen corresponding path program 1 times [2018-10-26 19:51:09,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:09,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:09,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:09,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:09,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:09,273 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-26 19:51:09,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:09,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:09,274 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:09,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:09,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:09,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:09,275 INFO L87 Difference]: Start difference. First operand 1516 states and 2052 transitions. Second operand 3 states. [2018-10-26 19:51:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:09,405 INFO L93 Difference]: Finished difference Result 4520 states and 6120 transitions. [2018-10-26 19:51:09,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:09,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-26 19:51:09,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:09,415 INFO L225 Difference]: With dead ends: 4520 [2018-10-26 19:51:09,415 INFO L226 Difference]: Without dead ends: 3016 [2018-10-26 19:51:09,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-10-26 19:51:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3014. [2018-10-26 19:51:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3014 states. [2018-10-26 19:51:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 4079 transitions. [2018-10-26 19:51:09,474 INFO L78 Accepts]: Start accepts. Automaton has 3014 states and 4079 transitions. Word has length 219 [2018-10-26 19:51:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:09,474 INFO L481 AbstractCegarLoop]: Abstraction has 3014 states and 4079 transitions. [2018-10-26 19:51:09,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3014 states and 4079 transitions. [2018-10-26 19:51:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-26 19:51:09,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:09,481 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:09,481 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:09,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:09,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2041426678, now seen corresponding path program 1 times [2018-10-26 19:51:09,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:09,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:09,484 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-26 19:51:09,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:09,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:09,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:09,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:09,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:09,613 INFO L87 Difference]: Start difference. First operand 3014 states and 4079 transitions. Second operand 3 states. [2018-10-26 19:51:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:10,790 INFO L93 Difference]: Finished difference Result 6324 states and 8530 transitions. [2018-10-26 19:51:10,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:10,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-26 19:51:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:10,801 INFO L225 Difference]: With dead ends: 6324 [2018-10-26 19:51:10,801 INFO L226 Difference]: Without dead ends: 3322 [2018-10-26 19:51:10,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2018-10-26 19:51:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2018-10-26 19:51:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-10-26 19:51:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4411 transitions. [2018-10-26 19:51:10,865 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4411 transitions. Word has length 219 [2018-10-26 19:51:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:10,866 INFO L481 AbstractCegarLoop]: Abstraction has 3306 states and 4411 transitions. [2018-10-26 19:51:10,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4411 transitions. [2018-10-26 19:51:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-26 19:51:10,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:10,873 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:10,873 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:10,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1667749177, now seen corresponding path program 1 times [2018-10-26 19:51:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:10,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:10,877 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-10-26 19:51:10,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:10,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:10,953 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:10,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:10,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:10,954 INFO L87 Difference]: Start difference. First operand 3306 states and 4411 transitions. Second operand 3 states. [2018-10-26 19:51:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:11,332 INFO L93 Difference]: Finished difference Result 6752 states and 8990 transitions. [2018-10-26 19:51:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:11,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-26 19:51:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:11,344 INFO L225 Difference]: With dead ends: 6752 [2018-10-26 19:51:11,344 INFO L226 Difference]: Without dead ends: 3458 [2018-10-26 19:51:11,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2018-10-26 19:51:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3442. [2018-10-26 19:51:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3442 states. [2018-10-26 19:51:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 4567 transitions. [2018-10-26 19:51:11,421 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 4567 transitions. Word has length 244 [2018-10-26 19:51:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:11,421 INFO L481 AbstractCegarLoop]: Abstraction has 3442 states and 4567 transitions. [2018-10-26 19:51:11,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 4567 transitions. [2018-10-26 19:51:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-26 19:51:11,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:11,431 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:11,431 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:11,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:11,431 INFO L82 PathProgramCache]: Analyzing trace with hash 973731295, now seen corresponding path program 1 times [2018-10-26 19:51:11,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:11,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:11,435 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-26 19:51:11,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:11,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:11,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:11,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:11,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:11,602 INFO L87 Difference]: Start difference. First operand 3442 states and 4567 transitions. Second operand 3 states. [2018-10-26 19:51:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:11,825 INFO L93 Difference]: Finished difference Result 7280 states and 9798 transitions. [2018-10-26 19:51:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:11,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-10-26 19:51:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:11,835 INFO L225 Difference]: With dead ends: 7280 [2018-10-26 19:51:11,835 INFO L226 Difference]: Without dead ends: 3850 [2018-10-26 19:51:11,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2018-10-26 19:51:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3762. [2018-10-26 19:51:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3762 states. [2018-10-26 19:51:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 4943 transitions. [2018-10-26 19:51:11,906 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 4943 transitions. Word has length 255 [2018-10-26 19:51:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:11,907 INFO L481 AbstractCegarLoop]: Abstraction has 3762 states and 4943 transitions. [2018-10-26 19:51:11,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:11,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 4943 transitions. [2018-10-26 19:51:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 19:51:11,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:11,916 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:11,916 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:11,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:11,916 INFO L82 PathProgramCache]: Analyzing trace with hash -648407518, now seen corresponding path program 1 times [2018-10-26 19:51:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:11,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:11,917 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:12,029 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-26 19:51:12,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:12,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:12,030 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:12,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:12,032 INFO L87 Difference]: Start difference. First operand 3762 states and 4943 transitions. Second operand 3 states. [2018-10-26 19:51:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:12,278 INFO L93 Difference]: Finished difference Result 7928 states and 10358 transitions. [2018-10-26 19:51:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:12,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2018-10-26 19:51:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:12,295 INFO L225 Difference]: With dead ends: 7928 [2018-10-26 19:51:12,295 INFO L226 Difference]: Without dead ends: 4178 [2018-10-26 19:51:12,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2018-10-26 19:51:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 3890. [2018-10-26 19:51:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2018-10-26 19:51:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 5095 transitions. [2018-10-26 19:51:12,362 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 5095 transitions. Word has length 270 [2018-10-26 19:51:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:12,363 INFO L481 AbstractCegarLoop]: Abstraction has 3890 states and 5095 transitions. [2018-10-26 19:51:12,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:12,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 5095 transitions. [2018-10-26 19:51:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-26 19:51:12,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:12,371 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:12,371 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:12,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:12,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1418086511, now seen corresponding path program 1 times [2018-10-26 19:51:12,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:12,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-26 19:51:12,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:12,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:12,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:12,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:12,505 INFO L87 Difference]: Start difference. First operand 3890 states and 5095 transitions. Second operand 3 states. [2018-10-26 19:51:12,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:12,571 INFO L93 Difference]: Finished difference Result 11126 states and 14645 transitions. [2018-10-26 19:51:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:12,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-10-26 19:51:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:12,585 INFO L225 Difference]: With dead ends: 11126 [2018-10-26 19:51:12,586 INFO L226 Difference]: Without dead ends: 7248 [2018-10-26 19:51:12,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2018-10-26 19:51:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 7246. [2018-10-26 19:51:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7246 states. [2018-10-26 19:51:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7246 states to 7246 states and 9541 transitions. [2018-10-26 19:51:12,733 INFO L78 Accepts]: Start accepts. Automaton has 7246 states and 9541 transitions. Word has length 271 [2018-10-26 19:51:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:12,734 INFO L481 AbstractCegarLoop]: Abstraction has 7246 states and 9541 transitions. [2018-10-26 19:51:12,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7246 states and 9541 transitions. [2018-10-26 19:51:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-26 19:51:12,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:12,742 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:12,742 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -171244035, now seen corresponding path program 1 times [2018-10-26 19:51:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:12,744 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-26 19:51:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:51:12,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:51:12,864 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:12,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:51:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:51:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:12,865 INFO L87 Difference]: Start difference. First operand 7246 states and 9541 transitions. Second operand 3 states. [2018-10-26 19:51:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:13,256 INFO L93 Difference]: Finished difference Result 14488 states and 19058 transitions. [2018-10-26 19:51:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:51:13,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-10-26 19:51:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:13,271 INFO L225 Difference]: With dead ends: 14488 [2018-10-26 19:51:13,271 INFO L226 Difference]: Without dead ends: 7254 [2018-10-26 19:51:13,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:51:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2018-10-26 19:51:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 7222. [2018-10-26 19:51:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2018-10-26 19:51:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 9389 transitions. [2018-10-26 19:51:13,391 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 9389 transitions. Word has length 272 [2018-10-26 19:51:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:13,392 INFO L481 AbstractCegarLoop]: Abstraction has 7222 states and 9389 transitions. [2018-10-26 19:51:13,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:51:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 9389 transitions. [2018-10-26 19:51:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-26 19:51:13,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:13,403 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:13,404 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:13,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:13,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1582446926, now seen corresponding path program 1 times [2018-10-26 19:51:13,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:13,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:13,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:13,407 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-26 19:51:13,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:51:13,612 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:51:13,613 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-10-26 19:51:13,615 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [260], [263], [268], [271], [279], [284], [286], [292], [295], [303], [305], [307], [310], [318], [323], [325], [328], [330], [335], [337], [340], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:51:13,677 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:51:13,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:51:14,851 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:51:14,853 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 102 variables. [2018-10-26 19:51:14,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:14,878 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:51:16,937 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 76.01% of their original sizes. [2018-10-26 19:51:16,938 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:51:18,654 INFO L415 sIntCurrentIteration]: We unified 294 AI predicates to 294 [2018-10-26 19:51:18,654 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:51:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:51:18,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2018-10-26 19:51:18,655 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:51:18,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:51:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:51:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:51:18,656 INFO L87 Difference]: Start difference. First operand 7222 states and 9389 transitions. Second operand 13 states. [2018-10-26 19:51:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:51:21,603 INFO L93 Difference]: Finished difference Result 14437 states and 18768 transitions. [2018-10-26 19:51:21,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:51:21,603 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 295 [2018-10-26 19:51:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:51:21,614 INFO L225 Difference]: With dead ends: 14437 [2018-10-26 19:51:21,614 INFO L226 Difference]: Without dead ends: 7227 [2018-10-26 19:51:21,623 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 296 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-10-26 19:51:21,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2018-10-26 19:51:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 7226. [2018-10-26 19:51:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7226 states. [2018-10-26 19:51:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 9393 transitions. [2018-10-26 19:51:21,795 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 9393 transitions. Word has length 295 [2018-10-26 19:51:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:51:21,795 INFO L481 AbstractCegarLoop]: Abstraction has 7226 states and 9393 transitions. [2018-10-26 19:51:21,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:51:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 9393 transitions. [2018-10-26 19:51:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-26 19:51:21,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:51:21,805 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:51:21,806 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:51:21,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:51:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash 519504681, now seen corresponding path program 1 times [2018-10-26 19:51:21,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:51:21,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:21,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:51:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:51:21,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:51:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:51:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-26 19:51:22,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:51:22,032 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:51:22,032 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 310 with the following transitions: [2018-10-26 19:51:22,033 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [284], [286], [292], [295], [303], [305], [307], [310], [318], [323], [325], [328], [330], [335], [337], [340], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:51:22,038 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:51:22,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:52:46,942 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:52:46,943 INFO L272 AbstractInterpreter]: Visited 108 different actions 2789 times. Merged at 98 different actions 2376 times. Widened at 25 different actions 345 times. Found 290 fixpoints after 32 different actions. Largest state had 104 variables. [2018-10-26 19:52:46,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:46,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:52:46,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:46,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:52:46,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:46,962 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:52:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:47,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:52:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-26 19:52:47,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:52:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 348 proven. 19 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-26 19:52:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:52:47,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:52:47,454 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:52:47,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:52:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:52:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:52:47,455 INFO L87 Difference]: Start difference. First operand 7226 states and 9393 transitions. Second operand 4 states. [2018-10-26 19:52:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:52:49,059 INFO L93 Difference]: Finished difference Result 14358 states and 18663 transitions. [2018-10-26 19:52:49,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:52:49,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-10-26 19:52:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:52:49,079 INFO L225 Difference]: With dead ends: 14358 [2018-10-26 19:52:49,079 INFO L226 Difference]: Without dead ends: 10832 [2018-10-26 19:52:49,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:52:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10832 states. [2018-10-26 19:52:49,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10832 to 9230. [2018-10-26 19:52:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9230 states. [2018-10-26 19:52:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9230 states to 9230 states and 12003 transitions. [2018-10-26 19:52:49,296 INFO L78 Accepts]: Start accepts. Automaton has 9230 states and 12003 transitions. Word has length 309 [2018-10-26 19:52:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:52:49,297 INFO L481 AbstractCegarLoop]: Abstraction has 9230 states and 12003 transitions. [2018-10-26 19:52:49,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:52:49,297 INFO L276 IsEmpty]: Start isEmpty. Operand 9230 states and 12003 transitions. [2018-10-26 19:52:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-26 19:52:49,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:52:49,311 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:52:49,311 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:52:49,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash 689635374, now seen corresponding path program 2 times [2018-10-26 19:52:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:52:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:49,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:52:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:49,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:52:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 439 proven. 6 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-26 19:52:49,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:49,534 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:52:49,534 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 19:52:49,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 19:52:49,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:49,534 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:52:49,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 19:52:49,549 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 19:52:49,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 19:52:49,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:52:49,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:52:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-10-26 19:52:49,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:52:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-10-26 19:52:49,906 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:52:49,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-10-26 19:52:49,906 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:52:49,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:52:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:52:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:52:49,907 INFO L87 Difference]: Start difference. First operand 9230 states and 12003 transitions. Second operand 3 states. [2018-10-26 19:52:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:52:50,425 INFO L93 Difference]: Finished difference Result 18906 states and 24616 transitions. [2018-10-26 19:52:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:52:50,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-10-26 19:52:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:52:50,441 INFO L225 Difference]: With dead ends: 18906 [2018-10-26 19:52:50,441 INFO L226 Difference]: Without dead ends: 9692 [2018-10-26 19:52:50,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 646 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:52:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2018-10-26 19:52:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9614. [2018-10-26 19:52:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2018-10-26 19:52:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 12507 transitions. [2018-10-26 19:52:50,601 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 12507 transitions. Word has length 323 [2018-10-26 19:52:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:52:50,602 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 12507 transitions. [2018-10-26 19:52:50,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:52:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 12507 transitions. [2018-10-26 19:52:50,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-26 19:52:50,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:52:50,612 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:52:50,613 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:52:50,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:52:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1198779057, now seen corresponding path program 1 times [2018-10-26 19:52:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:52:50,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:50,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:52:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:52:50,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:52:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:52:50,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 1034 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:52:50,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:52:50,832 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:52:50,833 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 395 with the following transitions: [2018-10-26 19:52:50,833 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [279], [284], [286], [290], [292], [295], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [340], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:52:50,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:52:50,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:54:28,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:54:28,823 INFO L272 AbstractInterpreter]: Visited 112 different actions 3327 times. Merged at 102 different actions 2752 times. Widened at 25 different actions 370 times. Found 434 fixpoints after 42 different actions. Largest state had 104 variables. [2018-10-26 19:54:28,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:28,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:54:28,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:28,835 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:54:28,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:28,842 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:54:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:28,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:54:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2018-10-26 19:54:29,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:54:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1784 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 889 trivial. 0 not checked. [2018-10-26 19:54:29,325 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:54:29,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-10-26 19:54:29,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:54:29,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:54:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:54:29,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:54:29,326 INFO L87 Difference]: Start difference. First operand 9614 states and 12507 transitions. Second operand 3 states. [2018-10-26 19:54:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:54:29,538 INFO L93 Difference]: Finished difference Result 24052 states and 31272 transitions. [2018-10-26 19:54:29,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:54:29,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 394 [2018-10-26 19:54:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:54:29,562 INFO L225 Difference]: With dead ends: 24052 [2018-10-26 19:54:29,562 INFO L226 Difference]: Without dead ends: 14454 [2018-10-26 19:54:29,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 788 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:54:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14454 states. [2018-10-26 19:54:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14454 to 14454. [2018-10-26 19:54:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14454 states. [2018-10-26 19:54:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14454 states to 14454 states and 18761 transitions. [2018-10-26 19:54:29,792 INFO L78 Accepts]: Start accepts. Automaton has 14454 states and 18761 transitions. Word has length 394 [2018-10-26 19:54:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:54:29,793 INFO L481 AbstractCegarLoop]: Abstraction has 14454 states and 18761 transitions. [2018-10-26 19:54:29,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:54:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14454 states and 18761 transitions. [2018-10-26 19:54:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-26 19:54:29,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:54:29,807 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:54:29,807 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:54:29,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:54:29,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2022036199, now seen corresponding path program 1 times [2018-10-26 19:54:29,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:54:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:29,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:54:29,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:54:29,808 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:54:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:54:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:54:29,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:54:29,975 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:54:29,975 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 397 with the following transitions: [2018-10-26 19:54:29,975 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [279], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [340], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:54:29,977 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:54:29,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:56:09,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:56:09,654 INFO L272 AbstractInterpreter]: Visited 112 different actions 3247 times. Merged at 102 different actions 2689 times. Widened at 25 different actions 356 times. Found 422 fixpoints after 43 different actions. Largest state had 104 variables. [2018-10-26 19:56:09,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:09,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:56:09,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:09,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:56:09,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:09,673 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:56:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:09,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:56:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:56:09,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:56:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 1036 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:56:10,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:56:10,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:56:10,059 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:56:10,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:56:10,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:56:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:56:10,060 INFO L87 Difference]: Start difference. First operand 14454 states and 18761 transitions. Second operand 4 states. [2018-10-26 19:56:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:10,407 INFO L93 Difference]: Finished difference Result 32448 states and 41926 transitions. [2018-10-26 19:56:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:56:10,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-26 19:56:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:10,431 INFO L225 Difference]: With dead ends: 32448 [2018-10-26 19:56:10,432 INFO L226 Difference]: Without dead ends: 17998 [2018-10-26 19:56:10,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:56:10,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17998 states. [2018-10-26 19:56:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17998 to 15291. [2018-10-26 19:56:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15291 states. [2018-10-26 19:56:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15291 states to 15291 states and 19423 transitions. [2018-10-26 19:56:10,686 INFO L78 Accepts]: Start accepts. Automaton has 15291 states and 19423 transitions. Word has length 396 [2018-10-26 19:56:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:10,687 INFO L481 AbstractCegarLoop]: Abstraction has 15291 states and 19423 transitions. [2018-10-26 19:56:10,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:56:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 15291 states and 19423 transitions. [2018-10-26 19:56:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-26 19:56:10,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:10,700 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:10,700 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:10,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2105870484, now seen corresponding path program 1 times [2018-10-26 19:56:10,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:56:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:10,701 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:56:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:10,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2124 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-26 19:56:10,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:56:10,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:56:10,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:56:10,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:56:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:56:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:56:10,868 INFO L87 Difference]: Start difference. First operand 15291 states and 19423 transitions. Second operand 3 states. [2018-10-26 19:56:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:56:11,050 INFO L93 Difference]: Finished difference Result 28976 states and 36446 transitions. [2018-10-26 19:56:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:56:11,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-10-26 19:56:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:56:11,058 INFO L225 Difference]: With dead ends: 28976 [2018-10-26 19:56:11,058 INFO L226 Difference]: Without dead ends: 5790 [2018-10-26 19:56:11,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:56:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5790 states. [2018-10-26 19:56:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5790 to 5437. [2018-10-26 19:56:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5437 states. [2018-10-26 19:56:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5437 states to 5437 states and 6710 transitions. [2018-10-26 19:56:11,155 INFO L78 Accepts]: Start accepts. Automaton has 5437 states and 6710 transitions. Word has length 436 [2018-10-26 19:56:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:56:11,155 INFO L481 AbstractCegarLoop]: Abstraction has 5437 states and 6710 transitions. [2018-10-26 19:56:11,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:56:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5437 states and 6710 transitions. [2018-10-26 19:56:11,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-26 19:56:11,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:56:11,163 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:56:11,163 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:56:11,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:56:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash 686504082, now seen corresponding path program 1 times [2018-10-26 19:56:11,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:56:11,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:56:11,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:56:11,164 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:56:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:56:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-10-26 19:56:11,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:56:11,397 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:56:11,397 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 464 with the following transitions: [2018-10-26 19:56:11,398 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [282], [286], [292], [295], [303], [305], [307], [310], [318], [323], [325], [328], [330], [335], [337], [340], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:56:11,400 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:56:11,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:57:36,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:57:36,449 INFO L272 AbstractInterpreter]: Visited 114 different actions 2863 times. Merged at 102 different actions 2427 times. Widened at 25 different actions 352 times. Found 310 fixpoints after 31 different actions. Largest state had 105 variables. [2018-10-26 19:57:36,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:57:36,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:57:36,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:57:36,454 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:57:36,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:57:36,461 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:57:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:57:36,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:57:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-10-26 19:57:36,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:57:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-10-26 19:57:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:57:36,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:57:36,703 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:57:36,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:57:36,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:57:36,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:57:36,704 INFO L87 Difference]: Start difference. First operand 5437 states and 6710 transitions. Second operand 4 states. [2018-10-26 19:57:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:57:36,816 INFO L93 Difference]: Finished difference Result 5946 states and 7347 transitions. [2018-10-26 19:57:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:57:36,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2018-10-26 19:57:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:57:36,818 INFO L225 Difference]: With dead ends: 5946 [2018-10-26 19:57:36,818 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:57:36,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:57:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:57:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:57:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:57:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:57:36,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 463 [2018-10-26 19:57:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:57:36,825 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:57:36,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:57:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:57:36,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:57:36,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:57:36,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:36,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,641 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 467 DAG size of output: 97 [2018-10-26 19:57:37,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:37,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:57:38,597 WARN L179 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2018-10-26 19:57:38,703 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2018-10-26 19:57:38,830 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2018-10-26 19:57:39,576 WARN L179 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 23 [2018-10-26 19:57:41,118 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2018-10-26 19:57:41,315 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:57:41,316 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-10-26 19:57:41,316 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L421 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-10-26 19:57:41,317 INFO L428 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L421 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0))) (or (and (<= ssl3_connect_~blastFlag~0 0) (<= ssl3_connect_~s__state~0 4560)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-10-26 19:57:41,317 INFO L421 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (let ((.cse0 (<= 4480 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-10-26 19:57:41,317 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-10-26 19:57:41,318 INFO L425 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L421 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-10-26 19:57:41,320 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L421 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= 4480 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) (= ssl3_connect_~s__hit~0 0) .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L421 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-10-26 19:57:41,321 INFO L421 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)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3))) [2018-10-26 19:57:41,321 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L421 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse4 (<= ssl3_connect_~s__state~0 4352)) (.cse5 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~blastFlag~0 0)) (.cse11 (= ssl3_connect_~s__state~0 4512)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse13 (= ssl3_connect_~s__state~0 4384)) (.cse1 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse9 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (= ssl3_connect_~s__hit~0 0)) (.cse8 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 .cse1 .cse2) (and .cse3 (= ssl3_connect_~s__state~0 4368)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse4 .cse5) (and .cse6 .cse4 .cse5 .cse7 .cse8 .cse9) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse7) (and .cse10 .cse6 .cse8) (and .cse11 .cse8 .cse7) (and .cse0 .cse12) (and .cse13 .cse3) (and (<= ssl3_connect_~blastFlag~0 4) .cse7 .cse8) (and .cse0 .cse11) (and .cse12 .cse8 .cse7) (and (= ssl3_connect_~s__state~0 4464) .cse7 .cse8) (and .cse13 (= ssl3_connect_~blastFlag~0 1)) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse9) (and .cse7 .cse8 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse7 .cse8) (and .cse10 .cse0 .cse6))) [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-10-26 19:57:41,322 INFO L421 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= 4480 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (= ssl3_connect_~s__hit~0 0) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-10-26 19:57:41,323 INFO L421 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2))) [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,323 INFO L425 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L421 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0))) (or (and .cse0 .cse1 .cse2) (and .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse0 .cse1 .cse4) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2 .cse4 .cse3))) [2018-10-26 19:57:41,324 INFO L421 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse2) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2))) [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-10-26 19:57:41,324 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L421 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (.cse4 (<= ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 .cse3 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse3) (and .cse4 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1) (and .cse4 .cse0 .cse1 .cse2))) [2018-10-26 19:57:41,325 INFO L421 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (<= 4464 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0) .cse2))) [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-10-26 19:57:41,325 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 533) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 75 545) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,326 INFO L428 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-10-26 19:57:41,326 INFO L421 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)))) [2018-10-26 19:57:41,326 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-10-26 19:57:41,334 INFO L425 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L421 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (let ((.cse0 (<= 4480 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1 .cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-10-26 19:57:41,335 INFO L421 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-10-26 19:57:41,335 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L428 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-10-26 19:57:41,335 INFO L425 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-10-26 19:57:41,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:57:41 BoogieIcfgContainer [2018-10-26 19:57:41,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:57:41,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:57:41,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:57:41,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:57:41,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:51:02" (3/4) ... [2018-10-26 19:57:41,380 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:57:41,395 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:57:41,396 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-26 19:57:41,396 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:57:41,403 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-26 19:57:41,404 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 19:57:41,405 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:57:41,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (blastFlag <= 0 && 4560 <= s__state)) || !(\old(initial_state) == 12292) [2018-10-26 19:57:41,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 0 && s__state <= 4560) || (s__hit == 0 && blastFlag <= 2)) || !(\old(initial_state) == 12292)) || ((s__hit == 0 && blastFlag <= 4) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 19:57:41,424 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) || (blastFlag <= 0 && s__state == 4368)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || !(\old(initial_state) == 12292)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state == 4512 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || (s__state == 4384 && blastFlag <= 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (blastFlag <= 2 && s__state == 4512)) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (s__state == 4384 && blastFlag == 1)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,425 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state) || !(\old(initial_state) == 12292)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) || !(\old(initial_state) == 12292)) || (((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) && s__hit == 0) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4480 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4480 <= s__state && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) [2018-10-26 19:57:41,426 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) [2018-10-26 19:57:41,498 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8b523313-ed08-4647-ba2d-53a1eb27d7fe/bin-2019/utaipan/witness.graphml [2018-10-26 19:57:41,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:57:41,499 INFO L168 Benchmark]: Toolchain (without parser) took 400169.67 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 955.8 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,500 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:57:41,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,500 INFO L168 Benchmark]: Boogie Preprocessor took 44.44 ms. Allocated memory is still 1.0 GB. Free memory is still 937.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:57:41,500 INFO L168 Benchmark]: RCFGBuilder took 936.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,504 INFO L168 Benchmark]: TraceAbstraction took 398676.65 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,505 INFO L168 Benchmark]: Witness Printer took 121.66 ms. Allocated memory is still 5.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2018-10-26 19:57:41,507 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.13 ms. Allocated memory is still 1.0 GB. Free memory was 955.8 MB in the beginning and 939.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.0 GB. Free memory was 939.7 MB in the beginning and 937.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.44 ms. Allocated memory is still 1.0 GB. Free memory is still 937.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 936.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 398676.65 ms. Allocated memory was 1.1 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 121.66 ms. Allocated memory is still 5.4 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. 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: ((((blastFlag <= 2 && s__hit == 0) && s__state <= 4560) && 4464 <= s__state) || !(\old(initial_state) == 12292)) || (((s__hit == 0 && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((((((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) || (blastFlag <= 0 && s__state == 4368)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || !(\old(initial_state) == 12292)) || (blastFlag <= 2 && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state == 4512 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || (s__state == 4384 && blastFlag <= 0)) || ((blastFlag <= 4 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (blastFlag <= 2 && s__state == 4512)) || ((s__state == 4528 && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0)) || ((s__state == 4464 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (s__state == 4384 && blastFlag == 1)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0)) || ((s__hit == 0 && 256 == s__s3__tmp__new_cipher__algorithms) && s__state == 4480)) || ((s__state == 4496 && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((s__state <= 3 && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((blastFlag <= 0 && s__state <= 4560) || (s__hit == 0 && blastFlag <= 2)) || !(\old(initial_state) == 12292)) || ((s__hit == 0 && blastFlag <= 4) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && 4480 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((((4480 <= s__state && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) || !(\old(initial_state) == 12292)) || (((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) && s__hit == 0) - 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: ((((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || (blastFlag <= 0 && 4560 <= s__state)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((blastFlag <= 2 && 4560 <= s__state) && s__hit == 0) || (((4560 <= s__state && blastFlag <= 4) && s__hit == 0) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((((4480 <= s__state && 256 == s__s3__tmp__new_cipher__algorithms) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((blastFlag <= 2 && 4480 <= s__state) && s__state <= 4560) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 256 == s__s3__tmp__new_cipher__algorithms)) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 398.5s OverallTime, 28 OverallIterations, 18 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 5774 SDtfs, 1907 SDslu, 3310 SDs, 0 SdLazy, 2653 SolverSat, 459 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4153 GetRequests, 4097 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15291occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 368.9s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.9940642923836205 AbsIntWeakeningRatio, 0.42857142857142855 AbsIntAvgWeakeningVarsNumRemoved, 391.3265306122449 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 5397 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 517 NumberOfFragments, 784 HoareAnnotationTreeSize, 26 FomulaSimplifications, 51371 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 26 FomulaSimplificationsInter, 5163 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 7683 NumberOfCodeBlocks, 7404 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 9530 ConstructedInterpolants, 0 QuantifiedInterpolants, 4244954 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3113 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 38 InterpolantComputations, 26 PerfectInterpolantSequences, 33115/33266 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...