./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/config/AutomizerReach.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_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4189574b2550552a572f663e591e000dc3f42b46 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:19:55,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:19:55,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:19:55,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:19:55,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:19:55,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:19:55,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:19:55,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:19:55,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:19:55,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:19:55,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:19:55,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:19:55,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:19:55,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:19:55,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:19:55,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:19:55,232 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:19:55,233 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:19:55,235 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:19:55,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:19:55,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:19:55,237 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:19:55,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:19:55,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:19:55,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:19:55,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:19:55,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:19:55,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:19:55,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:19:55,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:19:55,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:19:55,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:19:55,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:19:55,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:19:55,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:19:55,244 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:19:55,244 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 06:19:55,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:19:55,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:19:55,253 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:19:55,253 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 06:19:55,254 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:19:55,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:19:55,254 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:19:55,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:19:55,254 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:19:55,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:19:55,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:19:55,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:19:55,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:19:55,256 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:19:55,256 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:19:55,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:19:55,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:19:55,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:19:55,257 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:19:55,257 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:19:55,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:19:55,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:19:55,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-11-10 06:19:55,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:19:55,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:19:55,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:19:55,292 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:19:55,293 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:19:55,293 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 06:19:55,339 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/data/18f73b4ef/987dcf95bf684512984bd268ab49bb21/FLAGa6f87de66 [2018-11-10 06:19:55,759 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:19:55,760 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 06:19:55,768 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/data/18f73b4ef/987dcf95bf684512984bd268ab49bb21/FLAGa6f87de66 [2018-11-10 06:19:55,780 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/data/18f73b4ef/987dcf95bf684512984bd268ab49bb21 [2018-11-10 06:19:55,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:19:55,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 06:19:55,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:19:55,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:19:55,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:19:55,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:19:55" (1/1) ... [2018-11-10 06:19:55,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24840ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:55, skipping insertion in model container [2018-11-10 06:19:55,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:19:55" (1/1) ... [2018-11-10 06:19:55,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:19:55,830 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:19:55,968 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:19:55,971 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:19:56,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:19:56,010 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:19:56,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56 WrapperNode [2018-11-10 06:19:56,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:19:56,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:19:56,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:19:56,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:19:56,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... [2018-11-10 06:19:56,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:19:56,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:19:56,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:19:56,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:19:56,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:19:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:19:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:19:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 06:19:56,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:19:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 06:19:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-10 06:19:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 06:19:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-11-10 06:19:56,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 06:19:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 06:19:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:19:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:19:56,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:19:56,204 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 06:19:56,204 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 06:19:56,544 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:19:56,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:19:56 BoogieIcfgContainer [2018-11-10 06:19:56,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:19:56,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:19:56,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:19:56,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:19:56,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:19:55" (1/3) ... [2018-11-10 06:19:56,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed4c0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:19:56, skipping insertion in model container [2018-11-10 06:19:56,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:56" (2/3) ... [2018-11-10 06:19:56,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed4c0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:19:56, skipping insertion in model container [2018-11-10 06:19:56,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:19:56" (3/3) ... [2018-11-10 06:19:56,550 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-11-10 06:19:56,556 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:19:56,561 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:19:56,574 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:19:56,599 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:19:56,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:19:56,600 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:19:56,600 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:19:56,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:19:56,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:19:56,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:19:56,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:19:56,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:19:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-10 06:19:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 06:19:56,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:56,624 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-10 06:19:56,626 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:56,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash 171574540, now seen corresponding path program 1 times [2018-11-10 06:19:56,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:56,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:56,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:56,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:56,782 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-10 06:19:56,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:56,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:56,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:56,797 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-10 06:19:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:56,886 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-10 06:19:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:56,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 06:19:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:56,898 INFO L225 Difference]: With dead ends: 380 [2018-11-10 06:19:56,898 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 06:19:56,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:56,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 06:19:56,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-10 06:19:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 06:19:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-10 06:19:56,938 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-10 06:19:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:56,938 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-10 06:19:56,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-10 06:19:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 06:19:56,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:56,941 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-10 06:19:56,941 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:56,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1775768565, now seen corresponding path program 1 times [2018-11-10 06:19:56,941 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:56,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,000 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-10 06:19:57,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,003 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-10 06:19:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:57,121 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-11-10 06:19:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:57,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 06:19:57,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:57,123 INFO L225 Difference]: With dead ends: 476 [2018-11-10 06:19:57,123 INFO L226 Difference]: Without dead ends: 266 [2018-11-10 06:19:57,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-10 06:19:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-11-10 06:19:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 06:19:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-10 06:19:57,137 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-10 06:19:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:57,137 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-10 06:19:57,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-10 06:19:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 06:19:57,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:57,140 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-10 06:19:57,140 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:57,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 6279890, now seen corresponding path program 1 times [2018-11-10 06:19:57,140 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:57,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:57,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,216 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-10 06:19:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,217 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-10 06:19:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:57,381 INFO L93 Difference]: Finished difference Result 608 states and 912 transitions. [2018-11-10 06:19:57,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:57,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 06:19:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:57,383 INFO L225 Difference]: With dead ends: 608 [2018-11-10 06:19:57,383 INFO L226 Difference]: Without dead ends: 360 [2018-11-10 06:19:57,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-11-10 06:19:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 342. [2018-11-10 06:19:57,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-10 06:19:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 476 transitions. [2018-11-10 06:19:57,404 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 476 transitions. Word has length 63 [2018-11-10 06:19:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:57,404 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 476 transitions. [2018-11-10 06:19:57,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:57,405 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 476 transitions. [2018-11-10 06:19:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 06:19:57,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:57,407 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-10 06:19:57,407 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:57,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:57,407 INFO L82 PathProgramCache]: Analyzing trace with hash -127733616, now seen corresponding path program 1 times [2018-11-10 06:19:57,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:57,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:57,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,459 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-10 06:19:57,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,460 INFO L87 Difference]: Start difference. First operand 342 states and 476 transitions. Second operand 3 states. [2018-11-10 06:19:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:57,567 INFO L93 Difference]: Finished difference Result 724 states and 1022 transitions. [2018-11-10 06:19:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:57,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 06:19:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:57,570 INFO L225 Difference]: With dead ends: 724 [2018-11-10 06:19:57,570 INFO L226 Difference]: Without dead ends: 394 [2018-11-10 06:19:57,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-10 06:19:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-11-10 06:19:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 06:19:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-10 06:19:57,583 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-10 06:19:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:57,583 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-10 06:19:57,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-10 06:19:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 06:19:57,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:57,585 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-10 06:19:57,585 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1202772343, now seen corresponding path program 1 times [2018-11-10 06:19:57,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,652 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-10 06:19:57,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,653 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-10 06:19:57,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:57,775 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-10 06:19:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:57,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 06:19:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:57,777 INFO L225 Difference]: With dead ends: 860 [2018-11-10 06:19:57,778 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 06:19:57,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 06:19:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-10 06:19:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-10 06:19:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-10 06:19:57,794 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-10 06:19:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:57,794 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-10 06:19:57,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-10 06:19:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 06:19:57,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:57,796 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-10 06:19:57,796 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:57,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:57,797 INFO L82 PathProgramCache]: Analyzing trace with hash 145332238, now seen corresponding path program 1 times [2018-11-10 06:19:57,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:57,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:57,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,853 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-10 06:19:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,854 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-10 06:19:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:57,940 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-10 06:19:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:57,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 06:19:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:57,942 INFO L225 Difference]: With dead ends: 962 [2018-11-10 06:19:57,942 INFO L226 Difference]: Without dead ends: 512 [2018-11-10 06:19:57,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-10 06:19:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-10 06:19:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-10 06:19:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-10 06:19:57,953 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-10 06:19:57,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:57,953 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-10 06:19:57,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-10 06:19:57,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 06:19:57,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:57,955 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-10 06:19:57,955 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:57,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:57,955 INFO L82 PathProgramCache]: Analyzing trace with hash -718630428, now seen corresponding path program 1 times [2018-11-10 06:19:57,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:57,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:57,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:57,997 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-10 06:19:57,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:57,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:57,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:57,999 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-10 06:19:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,099 INFO L93 Difference]: Finished difference Result 1106 states and 1590 transitions. [2018-11-10 06:19:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 06:19:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,104 INFO L225 Difference]: With dead ends: 1106 [2018-11-10 06:19:58,105 INFO L226 Difference]: Without dead ends: 608 [2018-11-10 06:19:58,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-10 06:19:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 588. [2018-11-10 06:19:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 06:19:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 816 transitions. [2018-11-10 06:19:58,114 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 816 transitions. Word has length 102 [2018-11-10 06:19:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,114 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 816 transitions. [2018-11-10 06:19:58,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 816 transitions. [2018-11-10 06:19:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 06:19:58,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,116 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-10 06:19:58,116 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -852643934, now seen corresponding path program 1 times [2018-11-10 06:19:58,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,146 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-10 06:19:58,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,147 INFO L87 Difference]: Start difference. First operand 588 states and 816 transitions. Second operand 3 states. [2018-11-10 06:19:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,166 INFO L93 Difference]: Finished difference Result 1612 states and 2266 transitions. [2018-11-10 06:19:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 06:19:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,169 INFO L225 Difference]: With dead ends: 1612 [2018-11-10 06:19:58,169 INFO L226 Difference]: Without dead ends: 1036 [2018-11-10 06:19:58,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-10 06:19:58,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1034. [2018-11-10 06:19:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-10 06:19:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1459 transitions. [2018-11-10 06:19:58,185 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1459 transitions. Word has length 102 [2018-11-10 06:19:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,185 INFO L481 AbstractCegarLoop]: Abstraction has 1034 states and 1459 transitions. [2018-11-10 06:19:58,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1459 transitions. [2018-11-10 06:19:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 06:19:58,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,187 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-10 06:19:58,187 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1021046662, now seen corresponding path program 1 times [2018-11-10 06:19:58,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,213 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-10 06:19:58,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,214 INFO L87 Difference]: Start difference. First operand 1034 states and 1459 transitions. Second operand 3 states. [2018-11-10 06:19:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,348 INFO L93 Difference]: Finished difference Result 2056 states and 2912 transitions. [2018-11-10 06:19:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 06:19:58,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,351 INFO L225 Difference]: With dead ends: 2056 [2018-11-10 06:19:58,351 INFO L226 Difference]: Without dead ends: 1544 [2018-11-10 06:19:58,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2018-11-10 06:19:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2018-11-10 06:19:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-10 06:19:58,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2179 transitions. [2018-11-10 06:19:58,372 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2179 transitions. Word has length 102 [2018-11-10 06:19:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,372 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2179 transitions. [2018-11-10 06:19:58,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2179 transitions. [2018-11-10 06:19:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 06:19:58,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,374 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-10 06:19:58,374 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash 152232873, now seen corresponding path program 1 times [2018-11-10 06:19:58,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,414 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-10 06:19:58,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,415 INFO L87 Difference]: Start difference. First operand 1544 states and 2179 transitions. Second operand 3 states. [2018-11-10 06:19:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,443 INFO L93 Difference]: Finished difference Result 2056 states and 2906 transitions. [2018-11-10 06:19:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-10 06:19:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,447 INFO L225 Difference]: With dead ends: 2056 [2018-11-10 06:19:58,447 INFO L226 Difference]: Without dead ends: 2054 [2018-11-10 06:19:58,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-10 06:19:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2018-11-10 06:19:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-11-10 06:19:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2903 transitions. [2018-11-10 06:19:58,474 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2903 transitions. Word has length 104 [2018-11-10 06:19:58,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,475 INFO L481 AbstractCegarLoop]: Abstraction has 2054 states and 2903 transitions. [2018-11-10 06:19:58,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2903 transitions. [2018-11-10 06:19:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 06:19:58,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,477 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-10 06:19:58,477 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1773369778, now seen corresponding path program 1 times [2018-11-10 06:19:58,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,524 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-10 06:19:58,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,525 INFO L87 Difference]: Start difference. First operand 2054 states and 2903 transitions. Second operand 3 states. [2018-11-10 06:19:58,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,650 INFO L93 Difference]: Finished difference Result 4504 states and 6470 transitions. [2018-11-10 06:19:58,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-11-10 06:19:58,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,655 INFO L225 Difference]: With dead ends: 4504 [2018-11-10 06:19:58,655 INFO L226 Difference]: Without dead ends: 2446 [2018-11-10 06:19:58,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2018-11-10 06:19:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2334. [2018-11-10 06:19:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2334 states. [2018-11-10 06:19:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 2334 states and 3319 transitions. [2018-11-10 06:19:58,689 INFO L78 Accepts]: Start accepts. Automaton has 2334 states and 3319 transitions. Word has length 146 [2018-11-10 06:19:58,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,690 INFO L481 AbstractCegarLoop]: Abstraction has 2334 states and 3319 transitions. [2018-11-10 06:19:58,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2334 states and 3319 transitions. [2018-11-10 06:19:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 06:19:58,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,693 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-10 06:19:58,693 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash -529878549, now seen corresponding path program 1 times [2018-11-10 06:19:58,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,738 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-10 06:19:58,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,739 INFO L87 Difference]: Start difference. First operand 2334 states and 3319 transitions. Second operand 3 states. [2018-11-10 06:19:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:58,831 INFO L93 Difference]: Finished difference Result 4874 states and 6889 transitions. [2018-11-10 06:19:58,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:58,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-11-10 06:19:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:58,836 INFO L225 Difference]: With dead ends: 4874 [2018-11-10 06:19:58,836 INFO L226 Difference]: Without dead ends: 2552 [2018-11-10 06:19:58,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2018-11-10 06:19:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2526. [2018-11-10 06:19:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2018-11-10 06:19:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 3551 transitions. [2018-11-10 06:19:58,874 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 3551 transitions. Word has length 183 [2018-11-10 06:19:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:58,874 INFO L481 AbstractCegarLoop]: Abstraction has 2526 states and 3551 transitions. [2018-11-10 06:19:58,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 3551 transitions. [2018-11-10 06:19:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 06:19:58,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:58,877 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-10 06:19:58,878 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:58,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash -757521861, now seen corresponding path program 1 times [2018-11-10 06:19:58,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:58,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:58,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:58,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:58,940 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-10 06:19:58,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:58,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:58,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:58,942 INFO L87 Difference]: Start difference. First operand 2526 states and 3551 transitions. Second operand 3 states. [2018-11-10 06:19:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:59,042 INFO L93 Difference]: Finished difference Result 5272 states and 7390 transitions. [2018-11-10 06:19:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:59,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-11-10 06:19:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:59,047 INFO L225 Difference]: With dead ends: 5272 [2018-11-10 06:19:59,047 INFO L226 Difference]: Without dead ends: 2758 [2018-11-10 06:19:59,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-11-10 06:19:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2734. [2018-11-10 06:19:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-11-10 06:19:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 3799 transitions. [2018-11-10 06:19:59,087 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 3799 transitions. Word has length 205 [2018-11-10 06:19:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:59,088 INFO L481 AbstractCegarLoop]: Abstraction has 2734 states and 3799 transitions. [2018-11-10 06:19:59,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 3799 transitions. [2018-11-10 06:19:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 06:19:59,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:59,092 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-10 06:19:59,092 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:59,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:59,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1415964870, now seen corresponding path program 1 times [2018-11-10 06:19:59,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:59,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:59,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:59,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:59,162 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-10 06:19:59,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:59,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:59,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:59,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,163 INFO L87 Difference]: Start difference. First operand 2734 states and 3799 transitions. Second operand 3 states. [2018-11-10 06:19:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:59,263 INFO L93 Difference]: Finished difference Result 5704 states and 7910 transitions. [2018-11-10 06:19:59,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:59,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-10 06:19:59,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:59,269 INFO L225 Difference]: With dead ends: 5704 [2018-11-10 06:19:59,269 INFO L226 Difference]: Without dead ends: 2982 [2018-11-10 06:19:59,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2018-11-10 06:19:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2966. [2018-11-10 06:19:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2018-11-10 06:19:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 4071 transitions. [2018-11-10 06:19:59,309 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 4071 transitions. Word has length 230 [2018-11-10 06:19:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:59,309 INFO L481 AbstractCegarLoop]: Abstraction has 2966 states and 4071 transitions. [2018-11-10 06:19:59,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 4071 transitions. [2018-11-10 06:19:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 06:19:59,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:59,313 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-10 06:19:59,313 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:59,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash 845608380, now seen corresponding path program 1 times [2018-11-10 06:19:59,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:59,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:59,363 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-10 06:19:59,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:59,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,364 INFO L87 Difference]: Start difference. First operand 2966 states and 4071 transitions. Second operand 3 states. [2018-11-10 06:19:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:59,458 INFO L93 Difference]: Finished difference Result 6200 states and 8526 transitions. [2018-11-10 06:19:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:59,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-10 06:19:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:59,464 INFO L225 Difference]: With dead ends: 6200 [2018-11-10 06:19:59,464 INFO L226 Difference]: Without dead ends: 3246 [2018-11-10 06:19:59,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2018-11-10 06:19:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3222. [2018-11-10 06:19:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-11-10 06:19:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4367 transitions. [2018-11-10 06:19:59,505 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4367 transitions. Word has length 230 [2018-11-10 06:19:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:59,506 INFO L481 AbstractCegarLoop]: Abstraction has 3222 states and 4367 transitions. [2018-11-10 06:19:59,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4367 transitions. [2018-11-10 06:19:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 06:19:59,510 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:59,510 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-10 06:19:59,510 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:59,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:59,510 INFO L82 PathProgramCache]: Analyzing trace with hash 97714442, now seen corresponding path program 1 times [2018-11-10 06:19:59,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:59,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:59,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:59,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:59,574 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-10 06:19:59,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:59,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:59,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:59,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:59,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,576 INFO L87 Difference]: Start difference. First operand 3222 states and 4367 transitions. Second operand 3 states. [2018-11-10 06:19:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:59,621 INFO L93 Difference]: Finished difference Result 9346 states and 12637 transitions. [2018-11-10 06:19:59,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:59,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 06:19:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:59,635 INFO L225 Difference]: With dead ends: 9346 [2018-11-10 06:19:59,635 INFO L226 Difference]: Without dead ends: 6136 [2018-11-10 06:19:59,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6136 states. [2018-11-10 06:19:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6136 to 6134. [2018-11-10 06:19:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6134 states. [2018-11-10 06:19:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8277 transitions. [2018-11-10 06:19:59,712 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8277 transitions. Word has length 261 [2018-11-10 06:19:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:59,713 INFO L481 AbstractCegarLoop]: Abstraction has 6134 states and 8277 transitions. [2018-11-10 06:19:59,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8277 transitions. [2018-11-10 06:19:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 06:19:59,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:19:59,719 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-10 06:19:59,719 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:19:59,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:19:59,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1935679604, now seen corresponding path program 1 times [2018-11-10 06:19:59,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:19:59,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:19:59,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:19:59,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:19:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:19:59,774 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-10 06:19:59,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:19:59,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:19:59,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:19:59,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:19:59,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,775 INFO L87 Difference]: Start difference. First operand 6134 states and 8277 transitions. Second operand 3 states. [2018-11-10 06:19:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:19:59,897 INFO L93 Difference]: Finished difference Result 12864 states and 17242 transitions. [2018-11-10 06:19:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:19:59,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 06:19:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:19:59,911 INFO L225 Difference]: With dead ends: 12864 [2018-11-10 06:19:59,911 INFO L226 Difference]: Without dead ends: 6742 [2018-11-10 06:19:59,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:19:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6742 states. [2018-11-10 06:19:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6742 to 6710. [2018-11-10 06:19:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6710 states. [2018-11-10 06:19:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6710 states to 6710 states and 8933 transitions. [2018-11-10 06:19:59,993 INFO L78 Accepts]: Start accepts. Automaton has 6710 states and 8933 transitions. Word has length 261 [2018-11-10 06:19:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:19:59,993 INFO L481 AbstractCegarLoop]: Abstraction has 6710 states and 8933 transitions. [2018-11-10 06:19:59,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:19:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6710 states and 8933 transitions. [2018-11-10 06:19:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-10 06:19:59,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:00,000 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-10 06:20:00,000 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:00,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash 258218028, now seen corresponding path program 1 times [2018-11-10 06:20:00,000 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:00,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:00,080 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-10 06:20:00,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:00,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:00,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:00,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,081 INFO L87 Difference]: Start difference. First operand 6710 states and 8933 transitions. Second operand 3 states. [2018-11-10 06:20:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:00,241 INFO L93 Difference]: Finished difference Result 13432 states and 17866 transitions. [2018-11-10 06:20:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:00,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-11-10 06:20:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:00,250 INFO L225 Difference]: With dead ends: 13432 [2018-11-10 06:20:00,250 INFO L226 Difference]: Without dead ends: 6734 [2018-11-10 06:20:00,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6734 states. [2018-11-10 06:20:00,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6734 to 6702. [2018-11-10 06:20:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6702 states. [2018-11-10 06:20:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6702 states to 6702 states and 8829 transitions. [2018-11-10 06:20:00,336 INFO L78 Accepts]: Start accepts. Automaton has 6702 states and 8829 transitions. Word has length 286 [2018-11-10 06:20:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:00,336 INFO L481 AbstractCegarLoop]: Abstraction has 6702 states and 8829 transitions. [2018-11-10 06:20:00,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 6702 states and 8829 transitions. [2018-11-10 06:20:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-10 06:20:00,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:00,343 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-10 06:20:00,343 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1080231137, now seen corresponding path program 1 times [2018-11-10 06:20:00,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:00,397 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-10 06:20:00,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:00,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:00,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,399 INFO L87 Difference]: Start difference. First operand 6702 states and 8829 transitions. Second operand 3 states. [2018-11-10 06:20:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:00,540 INFO L93 Difference]: Finished difference Result 14208 states and 19002 transitions. [2018-11-10 06:20:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:00,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-11-10 06:20:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:00,549 INFO L225 Difference]: With dead ends: 14208 [2018-11-10 06:20:00,549 INFO L226 Difference]: Without dead ends: 7518 [2018-11-10 06:20:00,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7518 states. [2018-11-10 06:20:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7518 to 7342. [2018-11-10 06:20:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-11-10 06:20:00,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 9581 transitions. [2018-11-10 06:20:00,633 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 9581 transitions. Word has length 297 [2018-11-10 06:20:00,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:00,633 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 9581 transitions. [2018-11-10 06:20:00,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:00,633 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 9581 transitions. [2018-11-10 06:20:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-11-10 06:20:00,640 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:00,640 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-10 06:20:00,640 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:00,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash -836254489, now seen corresponding path program 1 times [2018-11-10 06:20:00,641 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:00,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:00,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:00,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:00,731 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-10 06:20:00,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:00,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:00,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,732 INFO L87 Difference]: Start difference. First operand 7342 states and 9581 transitions. Second operand 3 states. [2018-11-10 06:20:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:00,941 INFO L93 Difference]: Finished difference Result 15496 states and 20114 transitions. [2018-11-10 06:20:00,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:00,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-11-10 06:20:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:00,955 INFO L225 Difference]: With dead ends: 15496 [2018-11-10 06:20:00,955 INFO L226 Difference]: Without dead ends: 8166 [2018-11-10 06:20:00,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:00,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2018-11-10 06:20:01,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 7590. [2018-11-10 06:20:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-10 06:20:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 9877 transitions. [2018-11-10 06:20:01,079 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 9877 transitions. Word has length 312 [2018-11-10 06:20:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:01,079 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 9877 transitions. [2018-11-10 06:20:01,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 9877 transitions. [2018-11-10 06:20:01,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 06:20:01,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:01,091 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-10 06:20:01,091 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:01,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1454941809, now seen corresponding path program 1 times [2018-11-10 06:20:01,092 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:01,196 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-10 06:20:01,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:01,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:01,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:01,197 INFO L87 Difference]: Start difference. First operand 7590 states and 9877 transitions. Second operand 3 states. [2018-11-10 06:20:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:01,281 INFO L93 Difference]: Finished difference Result 12016 states and 15592 transitions. [2018-11-10 06:20:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:01,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-11-10 06:20:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:01,294 INFO L225 Difference]: With dead ends: 12016 [2018-11-10 06:20:01,294 INFO L226 Difference]: Without dead ends: 8142 [2018-11-10 06:20:01,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:01,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2018-11-10 06:20:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 8140. [2018-11-10 06:20:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8140 states. [2018-11-10 06:20:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8140 states to 8140 states and 10560 transitions. [2018-11-10 06:20:01,421 INFO L78 Accepts]: Start accepts. Automaton has 8140 states and 10560 transitions. Word has length 313 [2018-11-10 06:20:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:01,421 INFO L481 AbstractCegarLoop]: Abstraction has 8140 states and 10560 transitions. [2018-11-10 06:20:01,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8140 states and 10560 transitions. [2018-11-10 06:20:01,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-10 06:20:01,434 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:01,434 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-10 06:20:01,434 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:01,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:01,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1768709470, now seen corresponding path program 1 times [2018-11-10 06:20:01,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:01,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:01,589 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-10 06:20:01,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:01,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:01,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:01,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:01,590 INFO L87 Difference]: Start difference. First operand 8140 states and 10560 transitions. Second operand 3 states. [2018-11-10 06:20:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:01,791 INFO L93 Difference]: Finished difference Result 15823 states and 20507 transitions. [2018-11-10 06:20:01,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:01,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-10 06:20:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:01,803 INFO L225 Difference]: With dead ends: 15823 [2018-11-10 06:20:01,803 INFO L226 Difference]: Without dead ends: 8143 [2018-11-10 06:20:01,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2018-11-10 06:20:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 8109. [2018-11-10 06:20:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8109 states. [2018-11-10 06:20:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8109 states to 8109 states and 10456 transitions. [2018-11-10 06:20:01,920 INFO L78 Accepts]: Start accepts. Automaton has 8109 states and 10456 transitions. Word has length 314 [2018-11-10 06:20:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:01,920 INFO L481 AbstractCegarLoop]: Abstraction has 8109 states and 10456 transitions. [2018-11-10 06:20:01,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8109 states and 10456 transitions. [2018-11-10 06:20:01,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-11-10 06:20:01,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:01,928 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-10 06:20:01,928 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:01,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:01,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1928129264, now seen corresponding path program 1 times [2018-11-10 06:20:01,928 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:01,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:01,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:01,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:02,034 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-10 06:20:02,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:20:02,035 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:20:02,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:02,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:20:02,238 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-10 06:20:02,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:20:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-11-10 06:20:02,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 06:20:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 06:20:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:20:02,267 INFO L87 Difference]: Start difference. First operand 8109 states and 10456 transitions. Second operand 7 states. [2018-11-10 06:20:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:03,342 INFO L93 Difference]: Finished difference Result 17821 states and 22858 transitions. [2018-11-10 06:20:03,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:20:03,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 337 [2018-11-10 06:20:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:03,357 INFO L225 Difference]: With dead ends: 17821 [2018-11-10 06:20:03,357 INFO L226 Difference]: Without dead ends: 9688 [2018-11-10 06:20:03,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-10 06:20:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9688 states. [2018-11-10 06:20:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9688 to 8257. [2018-11-10 06:20:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8257 states. [2018-11-10 06:20:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8257 states to 8257 states and 10466 transitions. [2018-11-10 06:20:03,537 INFO L78 Accepts]: Start accepts. Automaton has 8257 states and 10466 transitions. Word has length 337 [2018-11-10 06:20:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:03,537 INFO L481 AbstractCegarLoop]: Abstraction has 8257 states and 10466 transitions. [2018-11-10 06:20:03,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 06:20:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 8257 states and 10466 transitions. [2018-11-10 06:20:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-10 06:20:03,550 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:03,551 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-10 06:20:03,551 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:03,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1051762384, now seen corresponding path program 1 times [2018-11-10 06:20:03,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:03,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:03,708 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-10 06:20:03,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:20:03,709 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:20:03,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:03,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:20:03,890 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-10 06:20:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 06:20:03,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 06:20:03,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:20:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:20:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:20:03,919 INFO L87 Difference]: Start difference. First operand 8257 states and 10466 transitions. Second operand 5 states. [2018-11-10 06:20:04,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:04,428 INFO L93 Difference]: Finished difference Result 16983 states and 21044 transitions. [2018-11-10 06:20:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 06:20:04,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 365 [2018-11-10 06:20:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:04,441 INFO L225 Difference]: With dead ends: 16983 [2018-11-10 06:20:04,441 INFO L226 Difference]: Without dead ends: 8737 [2018-11-10 06:20:04,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 06:20:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2018-11-10 06:20:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 7225. [2018-11-10 06:20:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2018-11-10 06:20:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 8769 transitions. [2018-11-10 06:20:04,584 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 8769 transitions. Word has length 365 [2018-11-10 06:20:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:04,585 INFO L481 AbstractCegarLoop]: Abstraction has 7225 states and 8769 transitions. [2018-11-10 06:20:04,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:20:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 8769 transitions. [2018-11-10 06:20:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-11-10 06:20:04,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:04,596 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-10 06:20:04,596 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:04,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash -68147695, now seen corresponding path program 1 times [2018-11-10 06:20:04,597 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:04,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:04,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:04,781 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-10 06:20:04,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:20:04,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:20:04,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 06:20:04,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:20:04,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:04,782 INFO L87 Difference]: Start difference. First operand 7225 states and 8769 transitions. Second operand 3 states. [2018-11-10 06:20:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:05,042 INFO L93 Difference]: Finished difference Result 13114 states and 15826 transitions. [2018-11-10 06:20:05,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:20:05,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-11-10 06:20:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:05,047 INFO L225 Difference]: With dead ends: 13114 [2018-11-10 06:20:05,048 INFO L226 Difference]: Without dead ends: 3625 [2018-11-10 06:20:05,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:20:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3625 states. [2018-11-10 06:20:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3625 to 3550. [2018-11-10 06:20:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3550 states. [2018-11-10 06:20:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4361 transitions. [2018-11-10 06:20:05,106 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4361 transitions. Word has length 438 [2018-11-10 06:20:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:05,106 INFO L481 AbstractCegarLoop]: Abstraction has 3550 states and 4361 transitions. [2018-11-10 06:20:05,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 06:20:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4361 transitions. [2018-11-10 06:20:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-10 06:20:05,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:20:05,110 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-10 06:20:05,111 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:20:05,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:20:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2081473004, now seen corresponding path program 1 times [2018-11-10 06:20:05,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:20:05,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:20:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:05,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:05,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:20:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:05,269 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-10 06:20:05,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:20:05,269 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:20:05,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:20:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:20:05,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:20:05,497 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-10 06:20:05,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:20:05,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 06:20:05,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 06:20:05,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:20:05,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:20:05,525 INFO L87 Difference]: Start difference. First operand 3550 states and 4361 transitions. Second operand 4 states. [2018-11-10 06:20:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:20:05,636 INFO L93 Difference]: Finished difference Result 4059 states and 4999 transitions. [2018-11-10 06:20:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:20:05,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-11-10 06:20:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:20:05,638 INFO L225 Difference]: With dead ends: 4059 [2018-11-10 06:20:05,638 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:20:05,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:20:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:20:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:20:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:20:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:20:05,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-11-10 06:20:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:20:05,646 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:20:05,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 06:20:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:20:05,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:20:05,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:20:05,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:05,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 06:20:06,002 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 87 [2018-11-10 06:20:07,196 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2018-11-10 06:20:07,216 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 06:20:07,216 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:20:07,216 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-10 06:20:07,216 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-10 06:20:07,216 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-10 06:20:07,216 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-10 06:20:07,217 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-10 06:20:07,217 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-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-10 06:20:07,217 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-10 06:20:07,218 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-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-10 06:20:07,218 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-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-10 06:20:07,218 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-10 06:20:07,218 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-10 06:20:07,219 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-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-10 06:20:07,219 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-10 06:20:07,220 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-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-10 06:20:07,220 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-11-10 06:20:07,221 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-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-10 06:20:07,221 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-10 06:20:07,221 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-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-10 06:20:07,221 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-10 06:20:07,222 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-10 06:20:07,222 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-10 06:20:07,222 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-10 06:20:07,222 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-11-10 06:20:07,225 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-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-10 06:20:07,225 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-10 06:20:07,226 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-11-10 06:20:07,227 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-10 06:20:07,227 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-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-10 06:20:07,227 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-10 06:20:07,227 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-10 06:20:07,227 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-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-10 06:20:07,228 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-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:20:07,228 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:20:07,228 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:20:07,229 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:20:07,229 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-10 06:20:07,229 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-10 06:20:07,229 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-10 06:20:07,229 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-10 06:20:07,229 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-10 06:20:07,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:20:07 BoogieIcfgContainer [2018-11-10 06:20:07,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:20:07,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:20:07,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:20:07,263 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:20:07,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:19:56" (3/4) ... [2018-11-10 06:20:07,269 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 06:20:07,276 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 06:20:07,276 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 06:20:07,277 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 06:20:07,283 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 06:20:07,284 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 06:20:07,285 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 06:20:07,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-10 06:20:07,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-10 06:20:07,308 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-10 06:20:07,308 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 06:20:07,308 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-10 06:20:07,308 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-10 06:20:07,308 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-10 06:20:07,308 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-10 06:20:07,309 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-10 06:20:07,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-10 06:20:07,309 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-10 06:20:07,309 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-10 06:20:07,309 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-10 06:20:07,310 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-10 06:20:07,310 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-10 06:20:07,310 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-10 06:20:07,310 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-10 06:20:07,358 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_defd155c-b8ec-46a3-8862-4082002aa0a0/bin-2019/uautomizer/witness.graphml [2018-11-10 06:20:07,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:20:07,359 INFO L168 Benchmark]: Toolchain (without parser) took 11575.94 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 858.3 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -352.6 MB). Peak memory consumption was 505.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,360 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:20:07,361 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.59 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,361 INFO L168 Benchmark]: Boogie Preprocessor took 75.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,362 INFO L168 Benchmark]: RCFGBuilder took 457.02 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,362 INFO L168 Benchmark]: TraceAbstraction took 10718.27 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 726.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -252.9 MB). Peak memory consumption was 473.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,362 INFO L168 Benchmark]: Witness Printer took 95.24 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:20:07,364 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.59 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 457.02 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10718.27 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 726.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -252.9 MB). Peak memory consumption was 473.2 MB. Max. memory is 11.5 GB. * Witness Printer took 95.24 ms. Allocated memory is still 1.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.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, 10.6s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 5428 SDtfs, 2089 SDslu, 3480 SDs, 0 SdLazy, 2776 SolverSat, 464 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1300 GetRequests, 1259 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8257occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 4166 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 557 HoareAnnotationTreeSize, 26 FomulaSimplifications, 15055 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1305 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 6659 NumberOfCodeBlocks, 6659 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 6630 ConstructedInterpolants, 0 QuantifiedInterpolants, 2554625 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2205 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 22993/23044 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...