./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.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_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 c53759a150934ef20fe7ff264c4326cfaaab3702 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:27:32,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:27:32,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:27:32,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:27:32,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:27:32,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:27:32,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:27:32,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:27:32,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:27:32,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:27:32,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:27:32,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:27:32,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:27:32,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:27:32,912 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:27:32,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:27:32,913 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:27:32,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:27:32,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:27:32,917 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:27:32,918 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:27:32,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:27:32,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:27:32,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:27:32,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:27:32,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:27:32,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:27:32,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:27:32,924 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:27:32,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:27:32,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:27:32,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:27:32,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:27:32,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:27:32,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:27:32,927 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:27:32,927 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 05:27:32,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:27:32,937 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:27:32,938 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:27:32,938 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:27:32,938 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:27:32,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:27:32,939 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:27:32,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:27:32,939 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:27:32,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:27:32,939 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:27:32,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:27:32,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:27:32,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:27:32,941 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:27:32,941 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:27:32,941 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:27:32,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:27:32,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:27:32,942 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:27:32,942 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:27:32,942 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:27:32,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:27:32,942 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_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 -> c53759a150934ef20fe7ff264c4326cfaaab3702 [2018-11-10 05:27:32,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:27:32,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:27:32,977 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:27:32,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:27:32,978 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:27:32,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 05:27:33,020 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/data/839a143f0/504779a16fa142249fe56fc870c58993/FLAG06afab36d [2018-11-10 05:27:33,356 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:27:33,356 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/sv-benchmarks/c/bitvector/s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 05:27:33,365 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/data/839a143f0/504779a16fa142249fe56fc870c58993/FLAG06afab36d [2018-11-10 05:27:33,377 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/data/839a143f0/504779a16fa142249fe56fc870c58993 [2018-11-10 05:27:33,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:27:33,381 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 05:27:33,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:33,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:27:33,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:27:33,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb40806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33, skipping insertion in model container [2018-11-10 05:27:33,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:27:33,422 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:27:33,577 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:33,579 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:27:33,614 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:27:33,622 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:27:33,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33 WrapperNode [2018-11-10 05:27:33,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:27:33,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:27:33,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:27:33,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:27:33,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... [2018-11-10 05:27:33,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:27:33,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:27:33,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:27:33,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:27:33,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 05:27:33,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:27:33,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:27:33,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 05:27:33,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:27:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 05:27:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 05:27:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 05:27:33,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:27:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:27:33,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:27:33,834 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:27:33,835 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:27:34,170 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:27:34,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:34 BoogieIcfgContainer [2018-11-10 05:27:34,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:27:34,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:27:34,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:27:34,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:27:34,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:27:33" (1/3) ... [2018-11-10 05:27:34,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573c5753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:34, skipping insertion in model container [2018-11-10 05:27:34,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:27:33" (2/3) ... [2018-11-10 05:27:34,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573c5753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:27:34, skipping insertion in model container [2018-11-10 05:27:34,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:34" (3/3) ... [2018-11-10 05:27:34,181 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-no-overflow.BV.c.cil.c [2018-11-10 05:27:34,189 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:27:34,196 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:27:34,211 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:27:34,239 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:27:34,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:27:34,240 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:27:34,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:27:34,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:27:34,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:27:34,240 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:27:34,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:27:34,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:27:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-11-10 05:27:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 05:27:34,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:34,264 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, 1] [2018-11-10 05:27:34,266 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:34,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:34,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1797654646, now seen corresponding path program 1 times [2018-11-10 05:27:34,273 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:34,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:34,432 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 05:27:34,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:34,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:34,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:34,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:34,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:34,447 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2018-11-10 05:27:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:34,567 INFO L93 Difference]: Finished difference Result 261 states and 437 transitions. [2018-11-10 05:27:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:34,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 05:27:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:34,576 INFO L225 Difference]: With dead ends: 261 [2018-11-10 05:27:34,576 INFO L226 Difference]: Without dead ends: 120 [2018-11-10 05:27:34,579 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 05:27:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-10 05:27:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-11-10 05:27:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-10 05:27:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2018-11-10 05:27:34,618 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 31 [2018-11-10 05:27:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:34,618 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2018-11-10 05:27:34,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2018-11-10 05:27:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 05:27:34,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:34,619 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:27:34,620 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:34,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash 871528874, now seen corresponding path program 1 times [2018-11-10 05:27:34,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:34,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:34,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:34,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:34,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:34,687 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand 3 states. [2018-11-10 05:27:34,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:34,822 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2018-11-10 05:27:34,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:34,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 05:27:34,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:34,824 INFO L225 Difference]: With dead ends: 242 [2018-11-10 05:27:34,824 INFO L226 Difference]: Without dead ends: 139 [2018-11-10 05:27:34,825 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 05:27:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-10 05:27:34,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-11-10 05:27:34,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 05:27:34,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2018-11-10 05:27:34,836 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 44 [2018-11-10 05:27:34,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:34,837 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2018-11-10 05:27:34,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:34,837 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2018-11-10 05:27:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 05:27:34,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:34,839 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-10 05:27:34,839 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:34,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1750703567, now seen corresponding path program 1 times [2018-11-10 05:27:34,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:34,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:34,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:34,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:27:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:34,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:34,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:34,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:34,908 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand 3 states. [2018-11-10 05:27:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:34,934 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2018-11-10 05:27:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:34,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-10 05:27:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:34,936 INFO L225 Difference]: With dead ends: 282 [2018-11-10 05:27:34,936 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 05:27:34,937 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 05:27:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 05:27:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-11-10 05:27:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 05:27:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 233 transitions. [2018-11-10 05:27:34,947 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 233 transitions. Word has length 59 [2018-11-10 05:27:34,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:34,947 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 233 transitions. [2018-11-10 05:27:34,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:34,947 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 233 transitions. [2018-11-10 05:27:34,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 05:27:34,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:34,949 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-10 05:27:34,949 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:34,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1610154957, now seen corresponding path program 1 times [2018-11-10 05:27:34,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:34,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:34,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:27:35,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,012 INFO L87 Difference]: Start difference. First operand 163 states and 233 transitions. Second operand 3 states. [2018-11-10 05:27:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,114 INFO L93 Difference]: Finished difference Result 304 states and 447 transitions. [2018-11-10 05:27:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-11-10 05:27:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,117 INFO L225 Difference]: With dead ends: 304 [2018-11-10 05:27:35,118 INFO L226 Difference]: Without dead ends: 185 [2018-11-10 05:27:35,119 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 05:27:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-10 05:27:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2018-11-10 05:27:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-10 05:27:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 256 transitions. [2018-11-10 05:27:35,130 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 256 transitions. Word has length 59 [2018-11-10 05:27:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,130 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 256 transitions. [2018-11-10 05:27:35,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 256 transitions. [2018-11-10 05:27:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 05:27:35,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,133 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 05:27:35,134 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash -779490760, now seen corresponding path program 1 times [2018-11-10 05:27:35,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 05:27:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,211 INFO L87 Difference]: Start difference. First operand 181 states and 256 transitions. Second operand 3 states. [2018-11-10 05:27:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,262 INFO L93 Difference]: Finished difference Result 453 states and 655 transitions. [2018-11-10 05:27:35,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 05:27:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,264 INFO L225 Difference]: With dead ends: 453 [2018-11-10 05:27:35,264 INFO L226 Difference]: Without dead ends: 316 [2018-11-10 05:27:35,265 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 05:27:35,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-10 05:27:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-11-10 05:27:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-10 05:27:35,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 452 transitions. [2018-11-10 05:27:35,279 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 452 transitions. Word has length 77 [2018-11-10 05:27:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,279 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 452 transitions. [2018-11-10 05:27:35,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 452 transitions. [2018-11-10 05:27:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 05:27:35,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,281 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-10 05:27:35,282 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 124963336, now seen corresponding path program 1 times [2018-11-10 05:27:35,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,327 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 05:27:35,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,329 INFO L87 Difference]: Start difference. First operand 316 states and 452 transitions. Second operand 3 states. [2018-11-10 05:27:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,426 INFO L93 Difference]: Finished difference Result 638 states and 933 transitions. [2018-11-10 05:27:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-10 05:27:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,428 INFO L225 Difference]: With dead ends: 638 [2018-11-10 05:27:35,428 INFO L226 Difference]: Without dead ends: 366 [2018-11-10 05:27:35,429 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 05:27:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-10 05:27:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 360. [2018-11-10 05:27:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-10 05:27:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 506 transitions. [2018-11-10 05:27:35,439 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 506 transitions. Word has length 96 [2018-11-10 05:27:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,439 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 506 transitions. [2018-11-10 05:27:35,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 506 transitions. [2018-11-10 05:27:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 05:27:35,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,441 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:35,442 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash 637746848, now seen corresponding path program 1 times [2018-11-10 05:27:35,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 05:27:35,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,500 INFO L87 Difference]: Start difference. First operand 360 states and 506 transitions. Second operand 3 states. [2018-11-10 05:27:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,570 INFO L93 Difference]: Finished difference Result 519 states and 733 transitions. [2018-11-10 05:27:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-10 05:27:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,573 INFO L225 Difference]: With dead ends: 519 [2018-11-10 05:27:35,573 INFO L226 Difference]: Without dead ends: 517 [2018-11-10 05:27:35,574 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 05:27:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-11-10 05:27:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2018-11-10 05:27:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-11-10 05:27:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 731 transitions. [2018-11-10 05:27:35,586 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 731 transitions. Word has length 117 [2018-11-10 05:27:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,586 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 731 transitions. [2018-11-10 05:27:35,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 731 transitions. [2018-11-10 05:27:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 05:27:35,588 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,588 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 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] [2018-11-10 05:27:35,588 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1630136903, now seen corresponding path program 1 times [2018-11-10 05:27:35,589 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 05:27:35,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,652 INFO L87 Difference]: Start difference. First operand 517 states and 731 transitions. Second operand 3 states. [2018-11-10 05:27:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,762 INFO L93 Difference]: Finished difference Result 1143 states and 1673 transitions. [2018-11-10 05:27:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-11-10 05:27:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,765 INFO L225 Difference]: With dead ends: 1143 [2018-11-10 05:27:35,765 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 05:27:35,766 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 05:27:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 05:27:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 643. [2018-11-10 05:27:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-11-10 05:27:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 932 transitions. [2018-11-10 05:27:35,778 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 932 transitions. Word has length 136 [2018-11-10 05:27:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,779 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 932 transitions. [2018-11-10 05:27:35,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 932 transitions. [2018-11-10 05:27:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 05:27:35,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,780 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:27:35,780 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1967005518, now seen corresponding path program 1 times [2018-11-10 05:27:35,781 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-10 05:27:35,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:35,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:35,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:35,827 INFO L87 Difference]: Start difference. First operand 643 states and 932 transitions. Second operand 3 states. [2018-11-10 05:27:35,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:35,943 INFO L93 Difference]: Finished difference Result 1526 states and 2281 transitions. [2018-11-10 05:27:35,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:35,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-11-10 05:27:35,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:35,946 INFO L225 Difference]: With dead ends: 1526 [2018-11-10 05:27:35,946 INFO L226 Difference]: Without dead ends: 876 [2018-11-10 05:27:35,948 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 05:27:35,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-11-10 05:27:35,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 838. [2018-11-10 05:27:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 05:27:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1190 transitions. [2018-11-10 05:27:35,963 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1190 transitions. Word has length 164 [2018-11-10 05:27:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:35,963 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1190 transitions. [2018-11-10 05:27:35,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1190 transitions. [2018-11-10 05:27:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 05:27:35,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:35,966 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 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 05:27:35,966 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:35,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:35,966 INFO L82 PathProgramCache]: Analyzing trace with hash 831710688, now seen corresponding path program 1 times [2018-11-10 05:27:35,966 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:35,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:35,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-10 05:27:36,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,014 INFO L87 Difference]: Start difference. First operand 838 states and 1190 transitions. Second operand 3 states. [2018-11-10 05:27:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:36,123 INFO L93 Difference]: Finished difference Result 1791 states and 2567 transitions. [2018-11-10 05:27:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:36,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-11-10 05:27:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:36,126 INFO L225 Difference]: With dead ends: 1791 [2018-11-10 05:27:36,126 INFO L226 Difference]: Without dead ends: 952 [2018-11-10 05:27:36,127 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 05:27:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-11-10 05:27:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 916. [2018-11-10 05:27:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-10 05:27:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1289 transitions. [2018-11-10 05:27:36,142 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1289 transitions. Word has length 186 [2018-11-10 05:27:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:36,142 INFO L481 AbstractCegarLoop]: Abstraction has 916 states and 1289 transitions. [2018-11-10 05:27:36,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1289 transitions. [2018-11-10 05:27:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:27:36,144 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:36,145 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-11-10 05:27:36,145 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:36,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:36,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2043460745, now seen corresponding path program 1 times [2018-11-10 05:27:36,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:36,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 05:27:36,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,221 INFO L87 Difference]: Start difference. First operand 916 states and 1289 transitions. Second operand 3 states. [2018-11-10 05:27:36,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:36,339 INFO L93 Difference]: Finished difference Result 1947 states and 2762 transitions. [2018-11-10 05:27:36,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:36,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-10 05:27:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:36,342 INFO L225 Difference]: With dead ends: 1947 [2018-11-10 05:27:36,342 INFO L226 Difference]: Without dead ends: 1036 [2018-11-10 05:27:36,343 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 05:27:36,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2018-11-10 05:27:36,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1003. [2018-11-10 05:27:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2018-11-10 05:27:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1403 transitions. [2018-11-10 05:27:36,360 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1403 transitions. Word has length 211 [2018-11-10 05:27:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:36,360 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1403 transitions. [2018-11-10 05:27:36,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1403 transitions. [2018-11-10 05:27:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:27:36,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:36,363 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 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] [2018-11-10 05:27:36,363 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:36,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1076110091, now seen corresponding path program 1 times [2018-11-10 05:27:36,363 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:36,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:36,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-10 05:27:36,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,407 INFO L87 Difference]: Start difference. First operand 1003 states and 1403 transitions. Second operand 3 states. [2018-11-10 05:27:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:36,513 INFO L93 Difference]: Finished difference Result 2121 states and 2993 transitions. [2018-11-10 05:27:36,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:36,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-10 05:27:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:36,516 INFO L225 Difference]: With dead ends: 2121 [2018-11-10 05:27:36,516 INFO L226 Difference]: Without dead ends: 1135 [2018-11-10 05:27:36,517 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 05:27:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2018-11-10 05:27:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1099. [2018-11-10 05:27:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1099 states. [2018-11-10 05:27:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1538 transitions. [2018-11-10 05:27:36,534 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1538 transitions. Word has length 211 [2018-11-10 05:27:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:36,534 INFO L481 AbstractCegarLoop]: Abstraction has 1099 states and 1538 transitions. [2018-11-10 05:27:36,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1538 transitions. [2018-11-10 05:27:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 05:27:36,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:36,536 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2018-11-10 05:27:36,537 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:36,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1781247057, now seen corresponding path program 1 times [2018-11-10 05:27:36,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:36,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,587 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 05:27:36,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,588 INFO L87 Difference]: Start difference. First operand 1099 states and 1538 transitions. Second operand 3 states. [2018-11-10 05:27:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:36,627 INFO L93 Difference]: Finished difference Result 3206 states and 4499 transitions. [2018-11-10 05:27:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:36,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-11-10 05:27:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:36,632 INFO L225 Difference]: With dead ends: 3206 [2018-11-10 05:27:36,632 INFO L226 Difference]: Without dead ends: 2151 [2018-11-10 05:27:36,633 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 05:27:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2018-11-10 05:27:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 2149. [2018-11-10 05:27:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2149 states. [2018-11-10 05:27:36,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3013 transitions. [2018-11-10 05:27:36,689 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3013 transitions. Word has length 242 [2018-11-10 05:27:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:36,690 INFO L481 AbstractCegarLoop]: Abstraction has 2149 states and 3013 transitions. [2018-11-10 05:27:36,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:36,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3013 transitions. [2018-11-10 05:27:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-10 05:27:36,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:36,693 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2018-11-10 05:27:36,693 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:36,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1546369585, now seen corresponding path program 1 times [2018-11-10 05:27:36,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:36,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:36,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-11-10 05:27:36,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,744 INFO L87 Difference]: Start difference. First operand 2149 states and 3013 transitions. Second operand 3 states. [2018-11-10 05:27:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:36,873 INFO L93 Difference]: Finished difference Result 4566 states and 6444 transitions. [2018-11-10 05:27:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:36,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-11-10 05:27:36,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:36,879 INFO L225 Difference]: With dead ends: 4566 [2018-11-10 05:27:36,879 INFO L226 Difference]: Without dead ends: 2431 [2018-11-10 05:27:36,881 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 05:27:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2431 states. [2018-11-10 05:27:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2431 to 2365. [2018-11-10 05:27:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-11-10 05:27:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3331 transitions. [2018-11-10 05:27:36,918 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3331 transitions. Word has length 242 [2018-11-10 05:27:36,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:36,919 INFO L481 AbstractCegarLoop]: Abstraction has 2365 states and 3331 transitions. [2018-11-10 05:27:36,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3331 transitions. [2018-11-10 05:27:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-10 05:27:36,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:36,922 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:27:36,923 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:36,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash -736436024, now seen corresponding path program 1 times [2018-11-10 05:27:36,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:36,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:36,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-11-10 05:27:36,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:36,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:36,978 INFO L87 Difference]: Start difference. First operand 2365 states and 3331 transitions. Second operand 3 states. [2018-11-10 05:27:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:37,101 INFO L93 Difference]: Finished difference Result 4752 states and 6684 transitions. [2018-11-10 05:27:37,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:37,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2018-11-10 05:27:37,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:37,106 INFO L225 Difference]: With dead ends: 4752 [2018-11-10 05:27:37,106 INFO L226 Difference]: Without dead ends: 2413 [2018-11-10 05:27:37,108 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 05:27:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2018-11-10 05:27:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2347. [2018-11-10 05:27:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2018-11-10 05:27:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3277 transitions. [2018-11-10 05:27:37,159 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3277 transitions. Word has length 278 [2018-11-10 05:27:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:37,159 INFO L481 AbstractCegarLoop]: Abstraction has 2347 states and 3277 transitions. [2018-11-10 05:27:37,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:37,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3277 transitions. [2018-11-10 05:27:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-10 05:27:37,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:37,163 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:37,163 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:37,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1606552194, now seen corresponding path program 1 times [2018-11-10 05:27:37,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-11-10 05:27:37,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:37,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:37,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:37,245 INFO L87 Difference]: Start difference. First operand 2347 states and 3277 transitions. Second operand 3 states. [2018-11-10 05:27:37,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:37,303 INFO L93 Difference]: Finished difference Result 6966 states and 9733 transitions. [2018-11-10 05:27:37,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:37,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-10 05:27:37,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:37,312 INFO L225 Difference]: With dead ends: 6966 [2018-11-10 05:27:37,312 INFO L226 Difference]: Without dead ends: 4663 [2018-11-10 05:27:37,315 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 05:27:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2018-11-10 05:27:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4661. [2018-11-10 05:27:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2018-11-10 05:27:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6493 transitions. [2018-11-10 05:27:37,383 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6493 transitions. Word has length 287 [2018-11-10 05:27:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:37,383 INFO L481 AbstractCegarLoop]: Abstraction has 4661 states and 6493 transitions. [2018-11-10 05:27:37,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6493 transitions. [2018-11-10 05:27:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-10 05:27:37,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:37,389 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:37,389 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:37,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1753430718, now seen corresponding path program 1 times [2018-11-10 05:27:37,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 05:27:37,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:37,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:37,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:37,453 INFO L87 Difference]: Start difference. First operand 4661 states and 6493 transitions. Second operand 3 states. [2018-11-10 05:27:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:37,630 INFO L93 Difference]: Finished difference Result 9355 states and 13024 transitions. [2018-11-10 05:27:37,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:37,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2018-11-10 05:27:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:37,641 INFO L225 Difference]: With dead ends: 9355 [2018-11-10 05:27:37,641 INFO L226 Difference]: Without dead ends: 4769 [2018-11-10 05:27:37,646 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 05:27:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2018-11-10 05:27:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4661. [2018-11-10 05:27:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2018-11-10 05:27:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 6385 transitions. [2018-11-10 05:27:37,779 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 6385 transitions. Word has length 287 [2018-11-10 05:27:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:37,779 INFO L481 AbstractCegarLoop]: Abstraction has 4661 states and 6385 transitions. [2018-11-10 05:27:37,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 6385 transitions. [2018-11-10 05:27:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-10 05:27:37,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:37,785 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 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 05:27:37,786 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:37,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:37,786 INFO L82 PathProgramCache]: Analyzing trace with hash -300774178, now seen corresponding path program 1 times [2018-11-10 05:27:37,786 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:37,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:37,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 05:27:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:37,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:37,850 INFO L87 Difference]: Start difference. First operand 4661 states and 6385 transitions. Second operand 3 states. [2018-11-10 05:27:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:37,985 INFO L93 Difference]: Finished difference Result 9853 states and 13390 transitions. [2018-11-10 05:27:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:37,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-11-10 05:27:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:37,999 INFO L225 Difference]: With dead ends: 9853 [2018-11-10 05:27:37,999 INFO L226 Difference]: Without dead ends: 5267 [2018-11-10 05:27:38,006 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 05:27:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2018-11-10 05:27:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 4847. [2018-11-10 05:27:38,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2018-11-10 05:27:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 6631 transitions. [2018-11-10 05:27:38,089 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 6631 transitions. Word has length 316 [2018-11-10 05:27:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:38,090 INFO L481 AbstractCegarLoop]: Abstraction has 4847 states and 6631 transitions. [2018-11-10 05:27:38,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 6631 transitions. [2018-11-10 05:27:38,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-10 05:27:38,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:38,096 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:38,096 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:38,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1093022024, now seen corresponding path program 1 times [2018-11-10 05:27:38,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:38,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 05:27:38,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:38,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:38,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:38,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:38,162 INFO L87 Difference]: Start difference. First operand 4847 states and 6631 transitions. Second operand 3 states. [2018-11-10 05:27:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:38,321 INFO L93 Difference]: Finished difference Result 9943 states and 13492 transitions. [2018-11-10 05:27:38,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:38,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-11-10 05:27:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:38,332 INFO L225 Difference]: With dead ends: 9943 [2018-11-10 05:27:38,333 INFO L226 Difference]: Without dead ends: 4655 [2018-11-10 05:27:38,339 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 05:27:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2018-11-10 05:27:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4637. [2018-11-10 05:27:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4637 states. [2018-11-10 05:27:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 6325 transitions. [2018-11-10 05:27:38,455 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 6325 transitions. Word has length 317 [2018-11-10 05:27:38,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:38,455 INFO L481 AbstractCegarLoop]: Abstraction has 4637 states and 6325 transitions. [2018-11-10 05:27:38,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:38,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 6325 transitions. [2018-11-10 05:27:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-10 05:27:38,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:38,464 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:27:38,464 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:38,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:38,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1068901372, now seen corresponding path program 1 times [2018-11-10 05:27:38,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:38,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:38,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:38,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 05:27:38,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:27:38,555 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 05:27:38,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:38,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2018-11-10 05:27:38,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:27:38,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-10 05:27:38,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:27:38,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:27:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:27:38,817 INFO L87 Difference]: Start difference. First operand 4637 states and 6325 transitions. Second operand 5 states. [2018-11-10 05:27:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:39,247 INFO L93 Difference]: Finished difference Result 10516 states and 14464 transitions. [2018-11-10 05:27:39,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:27:39,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 326 [2018-11-10 05:27:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:39,259 INFO L225 Difference]: With dead ends: 10516 [2018-11-10 05:27:39,259 INFO L226 Difference]: Without dead ends: 5765 [2018-11-10 05:27:39,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:27:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2018-11-10 05:27:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 4807. [2018-11-10 05:27:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4807 states. [2018-11-10 05:27:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6563 transitions. [2018-11-10 05:27:39,389 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6563 transitions. Word has length 326 [2018-11-10 05:27:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:39,389 INFO L481 AbstractCegarLoop]: Abstraction has 4807 states and 6563 transitions. [2018-11-10 05:27:39,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:27:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6563 transitions. [2018-11-10 05:27:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-11-10 05:27:39,399 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:39,399 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:27:39,399 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:39,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:39,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1027813780, now seen corresponding path program 1 times [2018-11-10 05:27:39,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:39,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:39,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:39,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 05:27:39,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:27:39,558 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 05:27:39,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:39,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-11-10 05:27:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:27:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 05:27:39,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:27:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:27:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:27:39,733 INFO L87 Difference]: Start difference. First operand 4807 states and 6563 transitions. Second operand 4 states. [2018-11-10 05:27:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:40,003 INFO L93 Difference]: Finished difference Result 6107 states and 8375 transitions. [2018-11-10 05:27:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:27:40,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2018-11-10 05:27:40,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:40,008 INFO L225 Difference]: With dead ends: 6107 [2018-11-10 05:27:40,008 INFO L226 Difference]: Without dead ends: 2481 [2018-11-10 05:27:40,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 329 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 05:27:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2018-11-10 05:27:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2018-11-10 05:27:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2018-11-10 05:27:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3400 transitions. [2018-11-10 05:27:40,081 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3400 transitions. Word has length 327 [2018-11-10 05:27:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:40,081 INFO L481 AbstractCegarLoop]: Abstraction has 2481 states and 3400 transitions. [2018-11-10 05:27:40,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:27:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3400 transitions. [2018-11-10 05:27:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-11-10 05:27:40,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:40,088 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 05:27:40,089 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:40,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1093305665, now seen corresponding path program 1 times [2018-11-10 05:27:40,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:27:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:27:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:40,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:27:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 05:27:40,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:27:40,209 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/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 05:27:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:40,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1360 backedges. 705 proven. 6 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-10 05:27:40,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:27:40,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 05:27:40,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:27:40,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:27:40,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:27:40,402 INFO L87 Difference]: Start difference. First operand 2481 states and 3400 transitions. Second operand 4 states. [2018-11-10 05:27:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:40,646 INFO L93 Difference]: Finished difference Result 3569 states and 4835 transitions. [2018-11-10 05:27:40,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:27:40,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 354 [2018-11-10 05:27:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:40,649 INFO L225 Difference]: With dead ends: 3569 [2018-11-10 05:27:40,649 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:27:40,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 356 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 05:27:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:27:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:27:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:27:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:27:40,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2018-11-10 05:27:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:40,657 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:27:40,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:27:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:27:40,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:27:40,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:27:40,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:40,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:27:41,224 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 3 [2018-11-10 05:27:41,493 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2018-11-10 05:27:41,728 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 436) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point L432-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 537) the Hoare annotation is: true [2018-11-10 05:27:41,729 INFO L421 ceAbstractionStarter]: At program point L168(lines 164 549) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 05:27:41,729 INFO L421 ceAbstractionStarter]: At program point L102(lines 101 570) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (= ssl3_connect_~s__state~0 12292)) [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 613) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point L401(lines 401 406) no Hoare annotation was computed. [2018-11-10 05:27:41,729 INFO L425 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 547) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L137(lines 137 558) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 569) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L421 ceAbstractionStarter]: At program point L138(lines 134 559) the Hoare annotation is: (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 05:27:41,730 INFO L421 ceAbstractionStarter]: At program point L535(lines 98 601) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~0)) (.cse5 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse3 (= ssl3_connect_~s__hit~0 0)) (.cse4 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse0 (<= ssl3_connect_~blastFlag~0 4))) (or (<= ssl3_connect_~s__state~0 3) (and (<= 4432 ssl3_connect_~s__state~0) .cse0 (<= ssl3_connect_~s__state~0 4528)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1 .cse2 .cse0 (not .cse3)) (and .cse0 .cse4 .cse5 .cse1 .cse2 .cse3) (<= ssl3_connect_~blastFlag~0 2) (and .cse5 (<= 4560 ssl3_connect_~s__state~0) .cse0 .cse3 (<= ssl3_connect_~s__state~0 4560) .cse4) (and (= ssl3_connect_~s__state~0 4416) .cse0))) [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L428 ceAbstractionStarter]: At program point L602(lines 97 603) the Hoare annotation is: true [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 546) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 557) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 568) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 376) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L425 ceAbstractionStarter]: For program point L372-2(lines 372 376) no Hoare annotation was computed. [2018-11-10 05:27:41,730 INFO L421 ceAbstractionStarter]: At program point L207(lines 104 569) the Hoare annotation is: (<= ssl3_connect_~blastFlag~0 2) [2018-11-10 05:27:41,731 INFO L421 ceAbstractionStarter]: At program point L174(lines 170 547) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4512) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 05:27:41,731 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 599) no Hoare annotation was computed. [2018-11-10 05:27:41,731 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2018-11-10 05:27:41,731 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2018-11-10 05:27:41,731 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 596) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L506-1(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L308-1(lines 308 322) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 545) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 556) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 567) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L606(lines 606 610) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 582) no Hoare annotation was computed. [2018-11-10 05:27:41,733 INFO L425 ceAbstractionStarter]: For program point L606-2(lines 606 610) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L573-2(lines 572 594) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L421 ceAbstractionStarter]: At program point L144(lines 140 557) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4448)) [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 448) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 216) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 544) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 555) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 566) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 316) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L425 ceAbstractionStarter]: For program point L312-2(lines 310 322) no Hoare annotation was computed. [2018-11-10 05:27:41,734 INFO L421 ceAbstractionStarter]: At program point L180(lines 176 545) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4528)) [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 511 515) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 416) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 253) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 543) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 554) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 565) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 65 619) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L421 ceAbstractionStarter]: At program point L150(lines 146 555) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4464) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 7 620) the Hoare annotation is: true [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 486) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L482-2(lines 482 486) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 292) no Hoare annotation was computed. [2018-11-10 05:27:41,735 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 542) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 553) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 564) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 388) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L421 ceAbstractionStarter]: At program point L186(lines 182 543) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~blastFlag~0 4))) (or (and .cse0 (<= ssl3_connect_~s__state~0 4560) .cse1) (and .cse0 .cse1 (not (= ssl3_connect_~s__hit~0 0))))) [2018-11-10 05:27:41,736 INFO L421 ceAbstractionStarter]: At program point L120(lines 116 565) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 05:27:41,736 INFO L421 ceAbstractionStarter]: At program point L352(lines 65 619) the Hoare annotation is: false [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point $Ultimate##87(lines 202 536) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L428 ceAbstractionStarter]: At program point L617(lines 65 619) the Hoare annotation is: true [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L584(lines 584 590) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 522) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 518 522) no Hoare annotation was computed. [2018-11-10 05:27:41,736 INFO L425 ceAbstractionStarter]: For program point $Ultimate##88(lines 202 536) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 291) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 541) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 552) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 563) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L453(lines 453 457) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 360) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 241) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 540) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 551) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L224-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point L125(lines 125 562) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 7 620) no Hoare annotation was computed. [2018-11-10 05:27:41,737 INFO L421 ceAbstractionStarter]: At program point L192(lines 188 541) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0) (and .cse0 (= ssl3_connect_~s__hit~0 0) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-11-10 05:27:41,738 INFO L421 ceAbstractionStarter]: At program point L126(lines 122 563) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 7 620) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 490 502) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 428) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 231) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 539) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L161(lines 161 550) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 561) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 529) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L421 ceAbstractionStarter]: At program point L195(lines 194 539) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 4)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse3 (= ssl3_connect_~s__hit~0 0))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 .cse2 (not .cse3)) (and .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse3))) [2018-11-10 05:27:41,738 INFO L421 ceAbstractionStarter]: At program point L162(lines 152 553) the Hoare annotation is: (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4480) (<= ssl3_connect_~blastFlag~0 4)) [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 498) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 471) no Hoare annotation was computed. [2018-11-10 05:27:41,738 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 460 471) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 266) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 399) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 333) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L329-2(lines 202 534) no Hoare annotation was computed. [2018-11-10 05:27:41,739 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 538) no Hoare annotation was computed. [2018-11-10 05:27:41,742 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 549) no Hoare annotation was computed. [2018-11-10 05:27:41,742 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 560) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 601) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L98-2(lines 65 619) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 468) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L428 ceAbstractionStarter]: At program point L198(lines 197 538) the Hoare annotation is: true [2018-11-10 05:27:41,743 INFO L421 ceAbstractionStarter]: At program point L132(lines 128 561) the Hoare annotation is: (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4432)) [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 237) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 548) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 559) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 570) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:27:41,743 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:27:41,744 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:27:41,744 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:27:41,744 INFO L425 ceAbstractionStarter]: For program point L626-1(line 626) no Hoare annotation was computed. [2018-11-10 05:27:41,744 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 621 631) the Hoare annotation is: true [2018-11-10 05:27:41,744 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 621 631) no Hoare annotation was computed. [2018-11-10 05:27:41,744 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 621 631) no Hoare annotation was computed. [2018-11-10 05:27:41,744 INFO L428 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: true [2018-11-10 05:27:41,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:27:41 BoogieIcfgContainer [2018-11-10 05:27:41,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:27:41,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:27:41,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:27:41,768 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:27:41,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:27:34" (3/4) ... [2018-11-10 05:27:41,771 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:27:41,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:27:41,777 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 05:27:41,778 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:27:41,786 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 05:27:41,787 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 05:27:41,788 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:27:41,859 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2b13c4dd-48a3-41ba-afb5-a225c6ceba31/bin-2019/uautomizer/witness.graphml [2018-11-10 05:27:41,859 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:27:41,859 INFO L168 Benchmark]: Toolchain (without parser) took 8478.88 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 696.8 MB). Free memory was 959.3 MB in the beginning and 1.4 GB in the end (delta: -440.6 MB). Peak memory consumption was 256.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,860 INFO L168 Benchmark]: CDTParser took 0.12 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 05:27:41,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 942.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,860 INFO L168 Benchmark]: Boogie Preprocessor took 86.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,861 INFO L168 Benchmark]: RCFGBuilder took 460.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,861 INFO L168 Benchmark]: TraceAbstraction took 7596.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 558.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -330.0 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,861 INFO L168 Benchmark]: Witness Printer took 91.33 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:27:41,862 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.91 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 942.1 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 460.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7596.51 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 558.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -330.0 MB). Peak memory consumption was 228.3 MB. Max. memory is 11.5 GB. * Witness Printer took 91.33 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 613]: 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: 98]: Loop Invariant Derived loop invariant: (((((s__state <= 3 || ((4432 <= s__state && blastFlag <= 4) && s__state <= 4528)) || ((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && !(s__hit == 0))) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0)) || blastFlag <= 2) || (((((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 == 4416 && blastFlag <= 4) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4464) && blastFlag <= 4 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (4352 <= s__state && blastFlag <= 4) && s__state <= 4432 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4560 <= s__state) || ((4560 <= s__state && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: blastFlag <= 2 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4480) && blastFlag <= 4 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4352) && 4352 <= s__state) || ((((s__s3__tmp__next_state___0 <= 3 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && !(s__hit == 0))) || (((((blastFlag <= 4 && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: blastFlag <= 2 && s__state == 12292 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4448 - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: ((4432 <= s__state && s__state <= 4560) && blastFlag <= 4) || ((4432 <= s__state && blastFlag <= 4) && !(s__hit == 0)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && 4352 <= s__state) && s__state <= 4432 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (4432 <= s__state && blastFlag <= 4) && s__state <= 4528 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (4432 <= s__state && s__state <= 4512) && blastFlag <= 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 137 locations, 1 error locations. SAFE Result, 7.5s OverallTime, 22 OverallIterations, 15 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4376 SDtfs, 1697 SDslu, 2860 SDs, 0 SdLazy, 2194 SolverSat, 533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1083 GetRequests, 1052 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4847occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1820 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 210 NumberOfFragments, 287 HoareAnnotationTreeSize, 27 FomulaSimplifications, 34452 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 6335 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 5374 NumberOfCodeBlocks, 5374 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5349 ConstructedInterpolants, 0 QuantifiedInterpolants, 2070471 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1917 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 25 InterpolantComputations, 20 PerfectInterpolantSequences, 16218/16269 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...