./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/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 4189574b2550552a572f663e591e000dc3f42b46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 09:24:25,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:24:25,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:24:25,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:24:25,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:24:25,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:24:25,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:24:25,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:24:25,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:24:25,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:24:25,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:24:25,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:24:25,347 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:24:25,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:24:25,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:24:25,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:24:25,351 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:24:25,353 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:24:25,354 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:24:25,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:24:25,357 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:24:25,358 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:24:25,360 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:24:25,360 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:24:25,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:24:25,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:24:25,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:24:25,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:24:25,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:24:25,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:24:25,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:24:25,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:24:25,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:24:25,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:24:25,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:24:25,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:24:25,367 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 09:24:25,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:24:25,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:24:25,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:24:25,381 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:24:25,381 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:24:25,381 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:24:25,382 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:24:25,383 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:24:25,383 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:24:25,384 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 09:24:25,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:24:25,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 09:24:25,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:24:25,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:24:25,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:24:25,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:24:25,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:24:25,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:24:25,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:24:25,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:24:25,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:24:25,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:24:25,388 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_d6c33f8f-345d-4cdf-ac60-61ee7048281c/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 -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-11-18 09:24:25,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:24:25,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:24:25,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:24:25,432 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:24:25,433 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:24:25,433 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-18 09:24:25,484 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/data/072f19383/7c17bda93f314d72bc7cfeb1fbe89865/FLAGb28250027 [2018-11-18 09:24:25,912 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:24:25,913 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-18 09:24:25,920 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/data/072f19383/7c17bda93f314d72bc7cfeb1fbe89865/FLAGb28250027 [2018-11-18 09:24:25,933 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/data/072f19383/7c17bda93f314d72bc7cfeb1fbe89865 [2018-11-18 09:24:25,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:24:25,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:24:25,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:25,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:24:25,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:24:25,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:25" (1/1) ... [2018-11-18 09:24:25,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf57369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:25, skipping insertion in model container [2018-11-18 09:24:25,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:25" (1/1) ... [2018-11-18 09:24:25,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:24:25,989 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:24:26,142 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:26,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:24:26,184 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:26,192 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:24:26,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26 WrapperNode [2018-11-18 09:24:26,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:26,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:26,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:24:26,193 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:24:26,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:26,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:24:26,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:24:26,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:24:26,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... [2018-11-18 09:24:26,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:24:26,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:24:26,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:24:26,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:24:26,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:24:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:24:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:24:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-18 09:24:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-18 09:24:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:24:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:24:26,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:24:26,318 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:24:26,411 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 09:24:26,411 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 09:24:26,756 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:24:26,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:26 BoogieIcfgContainer [2018-11-18 09:24:26,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:24:26,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:24:26,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:24:26,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:24:26,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:24:25" (1/3) ... [2018-11-18 09:24:26,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bccdec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:26, skipping insertion in model container [2018-11-18 09:24:26,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:26" (2/3) ... [2018-11-18 09:24:26,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bccdec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:26, skipping insertion in model container [2018-11-18 09:24:26,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:26" (3/3) ... [2018-11-18 09:24:26,762 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-18 09:24:26,768 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:24:26,773 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:24:26,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:24:26,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:24:26,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:24:26,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:24:26,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:24:26,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:24:26,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:24:26,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:24:26,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:24:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-18 09:24:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 09:24:26,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:26,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:26,830 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:26,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:26,834 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-11-18 09:24:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:26,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:26,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:26,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:24:26,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:26,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:26,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:26,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:26,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:26,995 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-18 09:24:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:27,095 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-18 09:24:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:27,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 09:24:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:27,106 INFO L225 Difference]: With dead ends: 380 [2018-11-18 09:24:27,106 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 09:24:27,110 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 09:24:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-18 09:24:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-18 09:24:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-18 09:24:27,156 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-18 09:24:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:27,156 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-18 09:24:27,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-18 09:24:27,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 09:24:27,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:27,159 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:27,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:27,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:27,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1775768565, now seen corresponding path program 1 times [2018-11-18 09:24:27,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 09:24:27,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:27,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:27,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:27,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:27,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:27,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,223 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-18 09:24:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:27,361 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-11-18 09:24:27,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:27,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-18 09:24:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:27,363 INFO L225 Difference]: With dead ends: 476 [2018-11-18 09:24:27,363 INFO L226 Difference]: Without dead ends: 266 [2018-11-18 09:24:27,365 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-18 09:24:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-11-18 09:24:27,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-18 09:24:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-18 09:24:27,382 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-18 09:24:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:27,382 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-18 09:24:27,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-18 09:24:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:24:27,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:27,384 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:27,385 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:27,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 6279890, now seen corresponding path program 1 times [2018-11-18 09:24:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:27,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:27,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:24:27,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:27,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:27,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:27,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:27,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:27,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,442 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-18 09:24:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:27,632 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-11-18 09:24:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:27,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 09:24:27,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:27,634 INFO L225 Difference]: With dead ends: 608 [2018-11-18 09:24:27,634 INFO L226 Difference]: Without dead ends: 360 [2018-11-18 09:24:27,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-18 09:24:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-11-18 09:24:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-18 09:24:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-11-18 09:24:27,648 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-11-18 09:24:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:27,648 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-11-18 09:24:27,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-11-18 09:24:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:24:27,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:27,651 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:27,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:27,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:27,652 INFO L82 PathProgramCache]: Analyzing trace with hash -127733616, now seen corresponding path program 1 times [2018-11-18 09:24:27,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:24:27,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:27,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:27,695 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:27,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:27,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,696 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-11-18 09:24:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:27,816 INFO L93 Difference]: Finished difference Result 724 states and 1022 transitions. [2018-11-18 09:24:27,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:27,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 09:24:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:27,818 INFO L225 Difference]: With dead ends: 724 [2018-11-18 09:24:27,818 INFO L226 Difference]: Without dead ends: 394 [2018-11-18 09:24:27,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-18 09:24:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-11-18 09:24:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-18 09:24:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-18 09:24:27,832 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-18 09:24:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:27,833 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-18 09:24:27,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-18 09:24:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-18 09:24:27,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:27,835 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:27,835 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:27,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1202772343, now seen corresponding path program 1 times [2018-11-18 09:24:27,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:27,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:24:27,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:27,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:27,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:27,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:27,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:27,890 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-18 09:24:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,032 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-18 09:24:28,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-18 09:24:28,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,034 INFO L225 Difference]: With dead ends: 860 [2018-11-18 09:24:28,034 INFO L226 Difference]: Without dead ends: 488 [2018-11-18 09:24:28,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-18 09:24:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-18 09:24:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-18 09:24:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-18 09:24:28,049 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-18 09:24:28,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,050 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-18 09:24:28,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,050 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-18 09:24:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-18 09:24:28,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,052 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, 1] [2018-11-18 09:24:28,052 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,052 INFO L82 PathProgramCache]: Analyzing trace with hash 145332238, now seen corresponding path program 1 times [2018-11-18 09:24:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 09:24:28,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,107 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,108 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-18 09:24:28,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,234 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-18 09:24:28,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-18 09:24:28,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,238 INFO L225 Difference]: With dead ends: 962 [2018-11-18 09:24:28,239 INFO L226 Difference]: Without dead ends: 512 [2018-11-18 09:24:28,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-18 09:24:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-18 09:24:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-18 09:24:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-18 09:24:28,259 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-18 09:24:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,259 INFO L480 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-18 09:24:28,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-18 09:24:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 09:24:28,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,261 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-18 09:24:28,261 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash -718630428, now seen corresponding path program 1 times [2018-11-18 09:24:28,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-18 09:24:28,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,317 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-18 09:24:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,440 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-11-18 09:24:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 09:24:28,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,444 INFO L225 Difference]: With dead ends: 1106 [2018-11-18 09:24:28,444 INFO L226 Difference]: Without dead ends: 608 [2018-11-18 09:24:28,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-18 09:24:28,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-11-18 09:24:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-18 09:24:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-11-18 09:24:28,461 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-11-18 09:24:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,461 INFO L480 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-11-18 09:24:28,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-11-18 09:24:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 09:24:28,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,463 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-18 09:24:28,463 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash -852643934, now seen corresponding path program 1 times [2018-11-18 09:24:28,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 09:24:28,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,526 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-11-18 09:24:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,554 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-11-18 09:24:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 09:24:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,558 INFO L225 Difference]: With dead ends: 1612 [2018-11-18 09:24:28,558 INFO L226 Difference]: Without dead ends: 1036 [2018-11-18 09:24:28,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-18 09:24:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-11-18 09:24:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-18 09:24:28,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-11-18 09:24:28,584 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-11-18 09:24:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,585 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-11-18 09:24:28,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-11-18 09:24:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-18 09:24:28,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,587 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] [2018-11-18 09:24:28,587 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1021046662, now seen corresponding path program 1 times [2018-11-18 09:24:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 09:24:28,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,637 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-11-18 09:24:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,678 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-11-18 09:24:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-18 09:24:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,684 INFO L225 Difference]: With dead ends: 2056 [2018-11-18 09:24:28,685 INFO L226 Difference]: Without dead ends: 1544 [2018-11-18 09:24:28,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-18 09:24:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-11-18 09:24:28,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-18 09:24:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-11-18 09:24:28,721 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-11-18 09:24:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,721 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-11-18 09:24:28,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-11-18 09:24:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-18 09:24:28,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,724 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, 1] [2018-11-18 09:24:28,724 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash 152232873, now seen corresponding path program 1 times [2018-11-18 09:24:28,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-18 09:24:28,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,777 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-11-18 09:24:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:28,822 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-11-18 09:24:28,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:28,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-18 09:24:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:28,829 INFO L225 Difference]: With dead ends: 2056 [2018-11-18 09:24:28,829 INFO L226 Difference]: Without dead ends: 2054 [2018-11-18 09:24:28,831 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-18 09:24:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-11-18 09:24:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-11-18 09:24:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-11-18 09:24:28,881 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-11-18 09:24:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:28,881 INFO L480 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-11-18 09:24:28,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-11-18 09:24:28,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 09:24:28,885 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:28,886 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2018-11-18 09:24:28,886 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:28,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:28,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1773369778, now seen corresponding path program 1 times [2018-11-18 09:24:28,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:28,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 09:24:28,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:28,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:28,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:28,930 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-11-18 09:24:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:29,092 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-11-18 09:24:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:29,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-11-18 09:24:29,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:29,101 INFO L225 Difference]: With dead ends: 4504 [2018-11-18 09:24:29,101 INFO L226 Difference]: Without dead ends: 2446 [2018-11-18 09:24:29,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-11-18 09:24:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-11-18 09:24:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-11-18 09:24:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-11-18 09:24:29,159 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 146 [2018-11-18 09:24:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:29,159 INFO L480 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-11-18 09:24:29,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-11-18 09:24:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 09:24:29,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:29,164 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2018-11-18 09:24:29,164 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:29,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash -529878549, now seen corresponding path program 1 times [2018-11-18 09:24:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-18 09:24:29,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:29,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:29,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:29,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,215 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-11-18 09:24:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:29,339 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-11-18 09:24:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:29,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-11-18 09:24:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:29,348 INFO L225 Difference]: With dead ends: 4874 [2018-11-18 09:24:29,348 INFO L226 Difference]: Without dead ends: 2552 [2018-11-18 09:24:29,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-11-18 09:24:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-11-18 09:24:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-11-18 09:24:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-11-18 09:24:29,419 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 183 [2018-11-18 09:24:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:29,419 INFO L480 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-11-18 09:24:29,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-11-18 09:24:29,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-18 09:24:29,425 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:29,425 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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] [2018-11-18 09:24:29,425 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:29,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:29,425 INFO L82 PathProgramCache]: Analyzing trace with hash -757521861, now seen corresponding path program 1 times [2018-11-18 09:24:29,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:29,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-11-18 09:24:29,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:29,524 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:29,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,525 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-11-18 09:24:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:29,649 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-11-18 09:24:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:29,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-18 09:24:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:29,657 INFO L225 Difference]: With dead ends: 5272 [2018-11-18 09:24:29,657 INFO L226 Difference]: Without dead ends: 2758 [2018-11-18 09:24:29,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-18 09:24:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-11-18 09:24:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-11-18 09:24:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-11-18 09:24:29,721 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 205 [2018-11-18 09:24:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:29,721 INFO L480 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-11-18 09:24:29,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-11-18 09:24:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 09:24:29,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:29,727 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:29,727 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:29,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1415964870, now seen corresponding path program 1 times [2018-11-18 09:24:29,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:29,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 09:24:29,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:29,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:29,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:29,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,787 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-11-18 09:24:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:29,908 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-11-18 09:24:29,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:29,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-18 09:24:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:29,917 INFO L225 Difference]: With dead ends: 5704 [2018-11-18 09:24:29,917 INFO L226 Difference]: Without dead ends: 2982 [2018-11-18 09:24:29,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-11-18 09:24:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-11-18 09:24:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-18 09:24:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-11-18 09:24:29,984 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 230 [2018-11-18 09:24:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:29,984 INFO L480 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-11-18 09:24:29,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-11-18 09:24:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 09:24:29,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:29,989 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:29,990 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:29,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:29,990 INFO L82 PathProgramCache]: Analyzing trace with hash 845608380, now seen corresponding path program 1 times [2018-11-18 09:24:29,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:29,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:29,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 09:24:30,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:30,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:30,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:30,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:30,048 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-11-18 09:24:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:30,182 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-11-18 09:24:30,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:30,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-18 09:24:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:30,192 INFO L225 Difference]: With dead ends: 6200 [2018-11-18 09:24:30,192 INFO L226 Difference]: Without dead ends: 3246 [2018-11-18 09:24:30,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-18 09:24:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-11-18 09:24:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-11-18 09:24:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-11-18 09:24:30,272 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 230 [2018-11-18 09:24:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:30,272 INFO L480 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-11-18 09:24:30,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-11-18 09:24:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-18 09:24:30,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:30,278 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2018-11-18 09:24:30,278 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:30,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:30,278 INFO L82 PathProgramCache]: Analyzing trace with hash 97714442, now seen corresponding path program 1 times [2018-11-18 09:24:30,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:30,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:30,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:30,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-11-18 09:24:30,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:30,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:30,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:30,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:30,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:30,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:30,379 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-11-18 09:24:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:30,524 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-11-18 09:24:30,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:30,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-18 09:24:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:30,545 INFO L225 Difference]: With dead ends: 9346 [2018-11-18 09:24:30,545 INFO L226 Difference]: Without dead ends: 6136 [2018-11-18 09:24:30,551 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-11-18 09:24:30,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-11-18 09:24:30,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-11-18 09:24:30,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-11-18 09:24:30,692 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 261 [2018-11-18 09:24:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:30,692 INFO L480 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-11-18 09:24:30,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-11-18 09:24:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-18 09:24:30,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:30,702 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 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] [2018-11-18 09:24:30,702 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:30,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1935679604, now seen corresponding path program 1 times [2018-11-18 09:24:30,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:30,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-11-18 09:24:30,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:30,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:30,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:30,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:30,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:30,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:30,777 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-11-18 09:24:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:30,975 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-11-18 09:24:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:30,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-18 09:24:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:30,991 INFO L225 Difference]: With dead ends: 12864 [2018-11-18 09:24:30,991 INFO L226 Difference]: Without dead ends: 6742 [2018-11-18 09:24:30,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-18 09:24:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-11-18 09:24:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-18 09:24:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-11-18 09:24:31,127 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 261 [2018-11-18 09:24:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:31,127 INFO L480 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-11-18 09:24:31,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-11-18 09:24:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-18 09:24:31,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:31,138 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:31,138 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash 258218028, now seen corresponding path program 1 times [2018-11-18 09:24:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:31,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:31,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:31,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-11-18 09:24:31,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:31,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:31,215 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:31,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:31,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:31,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,215 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-11-18 09:24:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:31,408 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-11-18 09:24:31,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:31,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-11-18 09:24:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:31,421 INFO L225 Difference]: With dead ends: 13432 [2018-11-18 09:24:31,421 INFO L226 Difference]: Without dead ends: 6734 [2018-11-18 09:24:31,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-11-18 09:24:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-11-18 09:24:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-18 09:24:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-11-18 09:24:31,587 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 286 [2018-11-18 09:24:31,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:31,588 INFO L480 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-11-18 09:24:31,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-11-18 09:24:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-18 09:24:31,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:31,598 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-11-18 09:24:31,598 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:31,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1080231137, now seen corresponding path program 1 times [2018-11-18 09:24:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:31,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:31,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-18 09:24:31,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:31,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:31,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:31,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:31,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,693 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-11-18 09:24:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:31,880 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-11-18 09:24:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:31,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-11-18 09:24:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:31,893 INFO L225 Difference]: With dead ends: 14208 [2018-11-18 09:24:31,893 INFO L226 Difference]: Without dead ends: 7518 [2018-11-18 09:24:31,903 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-11-18 09:24:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-11-18 09:24:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-18 09:24:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-11-18 09:24:32,022 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 297 [2018-11-18 09:24:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:32,022 INFO L480 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-11-18 09:24:32,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-11-18 09:24:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-18 09:24:32,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:32,033 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1] [2018-11-18 09:24:32,033 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:32,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:32,034 INFO L82 PathProgramCache]: Analyzing trace with hash -836254489, now seen corresponding path program 1 times [2018-11-18 09:24:32,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:32,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-11-18 09:24:32,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:32,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:32,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:32,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:32,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:32,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:32,111 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-11-18 09:24:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:32,296 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-11-18 09:24:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:32,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-11-18 09:24:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:32,311 INFO L225 Difference]: With dead ends: 15496 [2018-11-18 09:24:32,311 INFO L226 Difference]: Without dead ends: 8166 [2018-11-18 09:24:32,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-18 09:24:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-11-18 09:24:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-18 09:24:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-11-18 09:24:32,456 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 312 [2018-11-18 09:24:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:32,457 INFO L480 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-11-18 09:24:32,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-11-18 09:24:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-18 09:24:32,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:32,470 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-18 09:24:32,471 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:32,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1454941809, now seen corresponding path program 1 times [2018-11-18 09:24:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-11-18 09:24:32,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:32,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:32,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:32,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:32,653 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-11-18 09:24:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:32,744 INFO L93 Difference]: Finished difference Result 12016 states and 15592 transitions. [2018-11-18 09:24:32,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:32,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-18 09:24:32,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:32,760 INFO L225 Difference]: With dead ends: 12016 [2018-11-18 09:24:32,760 INFO L226 Difference]: Without dead ends: 8142 [2018-11-18 09:24:32,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2018-11-18 09:24:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 8140. [2018-11-18 09:24:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8140 states. [2018-11-18 09:24:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 10560 transitions. [2018-11-18 09:24:32,888 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 10560 transitions. Word has length 313 [2018-11-18 09:24:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:32,888 INFO L480 AbstractCegarLoop]: Abstraction has 8140 states and 10560 transitions. [2018-11-18 09:24:32,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 10560 transitions. [2018-11-18 09:24:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-18 09:24:32,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:32,900 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-11-18 09:24:32,900 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:32,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1768709470, now seen corresponding path program 1 times [2018-11-18 09:24:32,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:32,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-11-18 09:24:32,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:32,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:32,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:32,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:32,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:32,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:32,992 INFO L87 Difference]: Start difference. First operand 8140 states and 10560 transitions. Second operand 3 states. [2018-11-18 09:24:33,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:33,246 INFO L93 Difference]: Finished difference Result 15823 states and 20507 transitions. [2018-11-18 09:24:33,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:33,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-18 09:24:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:33,261 INFO L225 Difference]: With dead ends: 15823 [2018-11-18 09:24:33,261 INFO L226 Difference]: Without dead ends: 8143 [2018-11-18 09:24:33,271 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2018-11-18 09:24:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 8109. [2018-11-18 09:24:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-11-18 09:24:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 10456 transitions. [2018-11-18 09:24:33,393 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 10456 transitions. Word has length 314 [2018-11-18 09:24:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:33,394 INFO L480 AbstractCegarLoop]: Abstraction has 8109 states and 10456 transitions. [2018-11-18 09:24:33,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 10456 transitions. [2018-11-18 09:24:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-18 09:24:33,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:33,405 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:33,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:33,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:33,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1928129264, now seen corresponding path program 1 times [2018-11-18 09:24:33,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:33,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:33,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:33,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 677 proven. 15 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-11-18 09:24:33,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:33,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:33,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-11-18 09:24:33,514 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 09:24:33,549 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:24:33,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:24:34,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:24:34,216 INFO L272 AbstractInterpreter]: Visited 102 different actions 306 times. Merged at 84 different actions 179 times. Widened at 1 different actions 1 times. Performed 1576 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1576 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 32 fixpoints after 14 different actions. Largest state had 103 variables. [2018-11-18 09:24:34,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:34,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:24:34,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:34,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:34,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:34,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:24:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:34,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2018-11-18 09:24:34,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2018-11-18 09:24:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:24:34,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-11-18 09:24:34,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:34,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 09:24:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 09:24:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 09:24:34,654 INFO L87 Difference]: Start difference. First operand 8109 states and 10456 transitions. Second operand 5 states. [2018-11-18 09:24:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:35,132 INFO L93 Difference]: Finished difference Result 16394 states and 21149 transitions. [2018-11-18 09:24:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:24:35,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 337 [2018-11-18 09:24:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:35,146 INFO L225 Difference]: With dead ends: 16394 [2018-11-18 09:24:35,146 INFO L226 Difference]: Without dead ends: 8269 [2018-11-18 09:24:35,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 669 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-18 09:24:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2018-11-18 09:24:35,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 8116. [2018-11-18 09:24:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8116 states. [2018-11-18 09:24:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8116 states to 8116 states and 10465 transitions. [2018-11-18 09:24:35,334 INFO L78 Accepts]: Start accepts. Automaton has 8116 states and 10465 transitions. Word has length 337 [2018-11-18 09:24:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:35,334 INFO L480 AbstractCegarLoop]: Abstraction has 8116 states and 10465 transitions. [2018-11-18 09:24:35,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 09:24:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 8116 states and 10465 transitions. [2018-11-18 09:24:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-11-18 09:24:35,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:35,346 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:35,346 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:35,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:35,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1624257589, now seen corresponding path program 1 times [2018-11-18 09:24:35,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:35,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:35,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:35,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:35,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:35,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-18 09:24:35,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:35,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:35,523 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 352 with the following transitions: [2018-11-18 09:24:35,523 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 09:24:35,527 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:24:35,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:24:35,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:24:35,943 INFO L272 AbstractInterpreter]: Visited 111 different actions 324 times. Merged at 91 different actions 185 times. Never widened. Performed 1666 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 36 fixpoints after 16 different actions. Largest state had 105 variables. [2018-11-18 09:24:35,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:35,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:24:35,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:35,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:35,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:24:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:36,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-18 09:24:36,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:36,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-11-18 09:24:36,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:24:36,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 09:24:36,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:24:36,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:24:36,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:24:36,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:24:36,211 INFO L87 Difference]: Start difference. First operand 8116 states and 10465 transitions. Second operand 4 states. [2018-11-18 09:24:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:36,630 INFO L93 Difference]: Finished difference Result 13386 states and 17144 transitions. [2018-11-18 09:24:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 09:24:36,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-11-18 09:24:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:36,641 INFO L225 Difference]: With dead ends: 13386 [2018-11-18 09:24:36,641 INFO L226 Difference]: Without dead ends: 9688 [2018-11-18 09:24:36,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-11-18 09:24:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 8257. [2018-11-18 09:24:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8257 states. [2018-11-18 09:24:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 10466 transitions. [2018-11-18 09:24:36,734 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 10466 transitions. Word has length 351 [2018-11-18 09:24:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:36,734 INFO L480 AbstractCegarLoop]: Abstraction has 8257 states and 10466 transitions. [2018-11-18 09:24:36,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:24:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 10466 transitions. [2018-11-18 09:24:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-18 09:24:36,741 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:36,741 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:36,741 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:36,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1051762384, now seen corresponding path program 2 times [2018-11-18 09:24:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:36,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 770 proven. 6 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-11-18 09:24:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:36,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:36,827 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 09:24:36,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 09:24:36,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:36,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:36,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 09:24:36,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 09:24:36,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 09:24:36,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 09:24:36,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-11-18 09:24:36,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:37,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-11-18 09:24:37,070 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-18 09:24:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-18 09:24:37,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:37,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:37,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:24:37,071 INFO L87 Difference]: Start difference. First operand 8257 states and 10466 transitions. Second operand 3 states. [2018-11-18 09:24:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:37,248 INFO L93 Difference]: Finished difference Result 15519 states and 19355 transitions. [2018-11-18 09:24:37,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:37,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-18 09:24:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:37,260 INFO L225 Difference]: With dead ends: 15519 [2018-11-18 09:24:37,260 INFO L226 Difference]: Without dead ends: 7281 [2018-11-18 09:24:37,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 09:24:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7281 states. [2018-11-18 09:24:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7281 to 7257. [2018-11-18 09:24:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7257 states. [2018-11-18 09:24:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 8865 transitions. [2018-11-18 09:24:37,378 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 8865 transitions. Word has length 365 [2018-11-18 09:24:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:37,379 INFO L480 AbstractCegarLoop]: Abstraction has 7257 states and 8865 transitions. [2018-11-18 09:24:37,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 8865 transitions. [2018-11-18 09:24:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-18 09:24:37,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:37,384 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:37,385 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:37,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -443542314, now seen corresponding path program 1 times [2018-11-18 09:24:37,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:37,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:24:37,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:37,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:37,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 09:24:37,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:37,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:37,501 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-11-18 09:24:37,501 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [251], [257], [260], [265], [268], [270], [276], [281], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [421], [423], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 09:24:37,504 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:24:37,504 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:24:37,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:24:37,871 INFO L272 AbstractInterpreter]: Visited 113 different actions 341 times. Merged at 94 different actions 195 times. Never widened. Performed 1750 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1750 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 42 fixpoints after 18 different actions. Largest state had 105 variables. [2018-11-18 09:24:37,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:37,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:24:37,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:37,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:37,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:37,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:24:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:37,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 09:24:38,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-18 09:24:38,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:24:38,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 09:24:38,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:24:38,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:24:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:24:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:24:38,229 INFO L87 Difference]: Start difference. First operand 7257 states and 8865 transitions. Second operand 4 states. [2018-11-18 09:24:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:38,404 INFO L93 Difference]: Finished difference Result 15883 states and 19295 transitions. [2018-11-18 09:24:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:24:38,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-11-18 09:24:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:38,414 INFO L225 Difference]: With dead ends: 15883 [2018-11-18 09:24:38,414 INFO L226 Difference]: Without dead ends: 8713 [2018-11-18 09:24:38,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8713 states. [2018-11-18 09:24:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8713 to 7225. [2018-11-18 09:24:38,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2018-11-18 09:24:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 8769 transitions. [2018-11-18 09:24:38,500 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 8769 transitions. Word has length 398 [2018-11-18 09:24:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:38,501 INFO L480 AbstractCegarLoop]: Abstraction has 7225 states and 8769 transitions. [2018-11-18 09:24:38,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:24:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 8769 transitions. [2018-11-18 09:24:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-11-18 09:24:38,505 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:38,505 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:38,506 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:38,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:38,506 INFO L82 PathProgramCache]: Analyzing trace with hash -68147695, now seen corresponding path program 1 times [2018-11-18 09:24:38,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:38,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:38,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:38,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:38,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-18 09:24:38,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:38,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:38,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:38,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:38,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:38,598 INFO L87 Difference]: Start difference. First operand 7225 states and 8769 transitions. Second operand 3 states. [2018-11-18 09:24:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:38,740 INFO L93 Difference]: Finished difference Result 13114 states and 15826 transitions. [2018-11-18 09:24:38,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:38,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-11-18 09:24:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:38,745 INFO L225 Difference]: With dead ends: 13114 [2018-11-18 09:24:38,746 INFO L226 Difference]: Without dead ends: 3625 [2018-11-18 09:24:38,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2018-11-18 09:24:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3550. [2018-11-18 09:24:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-11-18 09:24:38,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4361 transitions. [2018-11-18 09:24:38,786 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4361 transitions. Word has length 438 [2018-11-18 09:24:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:38,786 INFO L480 AbstractCegarLoop]: Abstraction has 3550 states and 4361 transitions. [2018-11-18 09:24:38,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4361 transitions. [2018-11-18 09:24:38,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-18 09:24:38,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:38,790 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 13, 13, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:24:38,790 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:38,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:38,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2081473004, now seen corresponding path program 1 times [2018-11-18 09:24:38,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:38,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:38,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:38,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-18 09:24:38,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:38,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:38,897 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 506 with the following transitions: [2018-11-18 09:24:38,898 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [28], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [144], [146], [151], [156], [161], [164], [166], [171], [174], [176], [181], [184], [186], [191], [194], [204], [206], [209], [213], [218], [233], [239], [244], [246], [249], [257], [260], [265], [268], [276], [279], [283], [285], [290], [293], [295], [298], [306], [308], [310], [313], [315], [321], [326], [328], [331], [333], [338], [340], [345], [350], [352], [361], [366], [371], [373], [382], [387], [390], [398], [403], [405], [410], [413], [418], [423], [425], [430], [433], [437], [439], [449], [451], [518], [520], [532], [538], [542], [543], [544], [546] [2018-11-18 09:24:38,900 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:24:38,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:24:39,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 09:24:39,170 INFO L272 AbstractInterpreter]: Visited 117 different actions 346 times. Merged at 98 different actions 199 times. Widened at 1 different actions 1 times. Performed 1790 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1790 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 39 fixpoints after 16 different actions. Largest state had 106 variables. [2018-11-18 09:24:39,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:39,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 09:24:39,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:39,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:39,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:39,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 09:24:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:39,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-18 09:24:39,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-11-18 09:24:39,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:24:39,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-18 09:24:39,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 09:24:39,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 09:24:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 09:24:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:24:39,448 INFO L87 Difference]: Start difference. First operand 3550 states and 4361 transitions. Second operand 4 states. [2018-11-18 09:24:39,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:39,559 INFO L93 Difference]: Finished difference Result 4059 states and 4999 transitions. [2018-11-18 09:24:39,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 09:24:39,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-11-18 09:24:39,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:39,560 INFO L225 Difference]: With dead ends: 4059 [2018-11-18 09:24:39,560 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:24:39,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1010 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:24:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:24:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:24:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:24:39,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-11-18 09:24:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:39,564 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:24:39,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 09:24:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:24:39,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:24:39,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:24:39,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:24:39,852 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 87 [2018-11-18 09:24:40,465 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-11-18 09:24:40,487 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 09:24:40,487 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:24:40,487 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-18 09:24:40,487 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-18 09:24:40,487 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-18 09:24:40,487 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,488 INFO L421 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-18 09:24:40,488 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L421 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L421 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-18 09:24:40,489 INFO L421 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,490 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-18 09:24:40,490 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-18 09:24:40,493 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-18 09:24:40,493 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-18 09:24:40,493 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L421 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-18 09:24:40,494 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-18 09:24:40,495 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-11-18 09:24:40,496 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (not (= ssl3_connect_~s__hit~0 0)) (<= ssl3_connect_~s__state~0 4560)))) [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-18 09:24:40,496 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse3 (<= 4560 ssl3_connect_~s__state~0)) (.cse4 (<= ssl3_connect_~s__state~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse9 (not .cse1)) (.cse2 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ssl3_connect_~s__state~0 4352)) (.cse8 (<= 4352 ssl3_connect_~s__state~0)) (.cse5 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= ssl3_connect_~s__state~0 4512)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse12 (= ssl3_connect_~s__state~0 4528)) (.cse0 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 .cse1 (= ssl3_connect_~s__state~0 4480)) (and .cse2 .cse3 .cse0 .cse1 .cse4 .cse5) (and (= ssl3_connect_~s__state~0 4448) .cse0 .cse1) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse7 .cse8 .cse9) (and .cse6 .cse3 .cse9 .cse4) (and (= ssl3_connect_~s__state~0 4464) .cse0 .cse1) (and .cse10 .cse2 .cse0 .cse5) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse10 .cse2 .cse9) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse6 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse11 .cse0 .cse1) (and .cse6 .cse12) (< |ssl3_connect_#in~initial_state| 12292) (and .cse2 .cse7 .cse8 .cse0 .cse1 .cse5) (and (= ssl3_connect_~s__state~0 4496) .cse0 .cse1) (and .cse6 .cse11) (and .cse6 (= ssl3_connect_~s__state~0 4400) .cse1) (and .cse12 .cse0 .cse1)))) [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-11-18 09:24:40,497 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-18 09:24:40,498 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse1) .cse2))) [2018-11-18 09:24:40,499 INFO L421 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-18 09:24:40,499 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-18 09:24:40,499 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4)) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-18 09:24:40,500 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:24:40,500 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 09:24:40,500 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:24:40,501 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:24:40,501 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-18 09:24:40,501 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-18 09:24:40,501 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-18 09:24:40,501 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-18 09:24:40,501 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-18 09:24:40,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:24:40 BoogieIcfgContainer [2018-11-18 09:24:40,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:24:40,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:24:40,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:24:40,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:24:40,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:26" (3/4) ... [2018-11-18 09:24:40,545 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:24:40,550 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:24:40,551 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-18 09:24:40,552 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:24:40,559 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-18 09:24:40,560 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 09:24:40,560 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 09:24:40,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-18 09:24:40,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-18 09:24:40,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-11-18 09:24:40,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-18 09:24:40,583 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || \old(initial_state) < 12292) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0) [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-18 09:24:40,584 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-11-18 09:24:40,585 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-18 09:24:40,636 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d6c33f8f-345d-4cdf-ac60-61ee7048281c/bin-2019/utaipan/witness.graphml [2018-11-18 09:24:40,636 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:24:40,637 INFO L168 Benchmark]: Toolchain (without parser) took 14700.76 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 952.7 MB in the beginning and 976.4 MB in the end (delta: -23.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,637 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:24:40,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 933.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,639 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,640 INFO L168 Benchmark]: Boogie Preprocessor took 31.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,640 INFO L168 Benchmark]: RCFGBuilder took 474.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,640 INFO L168 Benchmark]: TraceAbstraction took 13779.78 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,640 INFO L168 Benchmark]: Witness Printer took 98.47 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 976.4 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:40,642 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 933.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -199.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 474.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13779.78 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 78.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 98.47 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 976.4 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: ((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || \old(initial_state) < 12292) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 13.7s OverallTime, 28 OverallIterations, 18 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5776 SDtfs, 2041 SDslu, 3336 SDs, 0 SdLazy, 2710 SolverSat, 463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4003 GetRequests, 3953 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8257occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 28 MinimizatonAttempts, 4319 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 557 HoareAnnotationTreeSize, 26 FomulaSimplifications, 18288 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1373 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 8157 NumberOfCodeBlocks, 7878 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 10075 ConstructedInterpolants, 0 QuantifiedInterpolants, 4198786 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3202 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 38 InterpolantComputations, 27 PerfectInterpolantSequences, 37681/37810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...