./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72fcebcfa7a668c9bb314320ec142761ff8c6a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:30:02,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:30:02,931 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:30:02,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:30:02,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:30:02,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:30:02,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:30:02,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:30:02,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:30:02,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:30:02,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:30:02,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:30:02,954 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:30:02,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:30:02,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:30:02,957 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:30:02,958 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:30:02,960 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:30:02,962 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:30:02,963 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:30:02,964 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:30:02,965 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:30:02,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:30:02,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:30:02,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:30:02,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:30:02,970 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:30:02,971 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:30:02,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:30:02,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:30:02,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:30:02,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:30:02,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:30:02,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:30:02,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:30:02,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:30:02,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-27 00:30:02,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:30:02,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:30:02,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:30:02,988 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:30:02,989 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:30:02,989 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:30:02,989 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 00:30:02,989 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:30:02,989 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:30:02,990 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:30:02,991 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:30:02,991 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:30:02,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:30:02,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:30:02,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:30:02,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:30:02,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:30:02,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:30:02,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:30:02,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:30:02,994 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 00:30:02,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:30:02,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:30:02,994 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_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a72fcebcfa7a668c9bb314320ec142761ff8c6a6 [2018-10-27 00:30:03,035 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:30:03,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:30:03,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:30:03,061 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:30:03,063 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:30:03,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-27 00:30:03,113 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/data/48d638ecb/dd9aeb66f96e49dcaf124d4ff567f791/FLAG8f96d63cb [2018-10-27 00:30:03,520 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:30:03,521 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/sv-benchmarks/c/ssh-simplified/s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-27 00:30:03,530 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/data/48d638ecb/dd9aeb66f96e49dcaf124d4ff567f791/FLAG8f96d63cb [2018-10-27 00:30:03,544 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/data/48d638ecb/dd9aeb66f96e49dcaf124d4ff567f791 [2018-10-27 00:30:03,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:30:03,550 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 00:30:03,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:30:03,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:30:03,558 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:30:03,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4489bfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03, skipping insertion in model container [2018-10-27 00:30:03,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:30:03,622 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:30:03,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:30:03,813 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:30:03,865 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:30:03,878 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:30:03,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03 WrapperNode [2018-10-27 00:30:03,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:30:03,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:30:03,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:30:03,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:30:03,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... [2018-10-27 00:30:03,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:30:03,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:30:03,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:30:03,936 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:30:03,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/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-10-27 00:30:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:30:04,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:30:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-27 00:30:04,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:30:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-27 00:30:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-10-27 00:30:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-27 00:30:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-10-27 00:30:04,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-10-27 00:30:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-27 00:30:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:30:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:30:04,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:30:04,264 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-27 00:30:04,265 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-27 00:30:05,014 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:30:05,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:05 BoogieIcfgContainer [2018-10-27 00:30:05,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:30:05,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:30:05,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:30:05,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:30:05,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:30:03" (1/3) ... [2018-10-27 00:30:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ef54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:30:05, skipping insertion in model container [2018-10-27 00:30:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:30:03" (2/3) ... [2018-10-27 00:30:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5ef54a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:30:05, skipping insertion in model container [2018-10-27 00:30:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:05" (3/3) ... [2018-10-27 00:30:05,023 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_true-unreach-call_true-termination.cil.c [2018-10-27 00:30:05,033 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:30:05,041 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:30:05,058 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:30:05,090 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 00:30:05,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:30:05,091 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:30:05,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:30:05,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:30:05,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:30:05,091 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:30:05,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:30:05,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:30:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-10-27 00:30:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-27 00:30:05,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:05,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:05,123 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:05,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 171568588, now seen corresponding path program 1 times [2018-10-27 00:30:05,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:05,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:05,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:05,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:05,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:05,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:05,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:05,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:05,435 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-10-27 00:30:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:05,609 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-10-27 00:30:05,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:05,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-27 00:30:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:05,629 INFO L225 Difference]: With dead ends: 377 [2018-10-27 00:30:05,629 INFO L226 Difference]: Without dead ends: 220 [2018-10-27 00:30:05,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-27 00:30:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-10-27 00:30:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-27 00:30:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-10-27 00:30:05,696 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 30 [2018-10-27 00:30:05,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:05,697 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-10-27 00:30:05,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:05,697 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-10-27 00:30:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 00:30:05,699 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:05,699 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:05,700 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:05,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:05,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1775774517, now seen corresponding path program 1 times [2018-10-27 00:30:05,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:05,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:05,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:05,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:30:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:05,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:05,782 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-10-27 00:30:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:06,345 INFO L93 Difference]: Finished difference Result 472 states and 709 transitions. [2018-10-27 00:30:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:06,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-27 00:30:06,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:06,349 INFO L225 Difference]: With dead ends: 472 [2018-10-27 00:30:06,349 INFO L226 Difference]: Without dead ends: 264 [2018-10-27 00:30:06,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-27 00:30:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-10-27 00:30:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-27 00:30:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 372 transitions. [2018-10-27 00:30:06,368 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 372 transitions. Word has length 45 [2018-10-27 00:30:06,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:06,369 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 372 transitions. [2018-10-27 00:30:06,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 372 transitions. [2018-10-27 00:30:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 00:30:06,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:06,371 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:06,371 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:06,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash 6273938, now seen corresponding path program 1 times [2018-10-27 00:30:06,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:06,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:06,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:06,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:06,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:06,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:06,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:06,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:06,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:06,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:06,445 INFO L87 Difference]: Start difference. First operand 256 states and 372 transitions. Second operand 3 states. [2018-10-27 00:30:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:06,894 INFO L93 Difference]: Finished difference Result 604 states and 908 transitions. [2018-10-27 00:30:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:06,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-27 00:30:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:06,897 INFO L225 Difference]: With dead ends: 604 [2018-10-27 00:30:06,898 INFO L226 Difference]: Without dead ends: 358 [2018-10-27 00:30:06,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-27 00:30:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2018-10-27 00:30:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 00:30:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 474 transitions. [2018-10-27 00:30:06,919 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 474 transitions. Word has length 63 [2018-10-27 00:30:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:06,926 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 474 transitions. [2018-10-27 00:30:06,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 474 transitions. [2018-10-27 00:30:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-27 00:30:06,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:06,928 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:06,929 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:06,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:06,929 INFO L82 PathProgramCache]: Analyzing trace with hash -127739568, now seen corresponding path program 1 times [2018-10-27 00:30:06,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:06,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:06,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:06,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:07,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:07,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:07,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,039 INFO L87 Difference]: Start difference. First operand 340 states and 474 transitions. Second operand 3 states. [2018-10-27 00:30:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:07,227 INFO L93 Difference]: Finished difference Result 716 states and 1013 transitions. [2018-10-27 00:30:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:07,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-27 00:30:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:07,238 INFO L225 Difference]: With dead ends: 716 [2018-10-27 00:30:07,239 INFO L226 Difference]: Without dead ends: 388 [2018-10-27 00:30:07,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-27 00:30:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2018-10-27 00:30:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-27 00:30:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2018-10-27 00:30:07,277 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 63 [2018-10-27 00:30:07,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:07,278 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2018-10-27 00:30:07,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2018-10-27 00:30:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:30:07,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:07,282 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:07,282 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:07,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:07,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1202766391, now seen corresponding path program 1 times [2018-10-27 00:30:07,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:07,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:07,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 00:30:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:07,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:07,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,387 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand 3 states. [2018-10-27 00:30:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:07,718 INFO L93 Difference]: Finished difference Result 856 states and 1218 transitions. [2018-10-27 00:30:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:07,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-27 00:30:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:07,726 INFO L225 Difference]: With dead ends: 856 [2018-10-27 00:30:07,726 INFO L226 Difference]: Without dead ends: 486 [2018-10-27 00:30:07,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-27 00:30:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 460. [2018-10-27 00:30:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-27 00:30:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 660 transitions. [2018-10-27 00:30:07,746 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 660 transitions. Word has length 77 [2018-10-27 00:30:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:07,747 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 660 transitions. [2018-10-27 00:30:07,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 660 transitions. [2018-10-27 00:30:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 00:30:07,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:07,751 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:07,752 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:07,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash -408124070, now seen corresponding path program 1 times [2018-10-27 00:30:07,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:07,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:07,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:07,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:30:07,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:07,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:07,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:07,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,818 INFO L87 Difference]: Start difference. First operand 460 states and 660 transitions. Second operand 3 states. [2018-10-27 00:30:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:07,976 INFO L93 Difference]: Finished difference Result 958 states and 1383 transitions. [2018-10-27 00:30:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:07,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-10-27 00:30:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:07,981 INFO L225 Difference]: With dead ends: 958 [2018-10-27 00:30:07,982 INFO L226 Difference]: Without dead ends: 510 [2018-10-27 00:30:07,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-27 00:30:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 504. [2018-10-27 00:30:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-10-27 00:30:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 714 transitions. [2018-10-27 00:30:07,999 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 714 transitions. Word has length 80 [2018-10-27 00:30:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:08,000 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 714 transitions. [2018-10-27 00:30:08,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 714 transitions. [2018-10-27 00:30:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-27 00:30:08,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:08,002 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:08,002 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:08,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1386271406, now seen corresponding path program 1 times [2018-10-27 00:30:08,003 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:08,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-27 00:30:08,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:08,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:08,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:08,102 INFO L87 Difference]: Start difference. First operand 504 states and 714 transitions. Second operand 3 states. [2018-10-27 00:30:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:08,404 INFO L93 Difference]: Finished difference Result 996 states and 1417 transitions. [2018-10-27 00:30:08,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:08,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-10-27 00:30:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:08,407 INFO L225 Difference]: With dead ends: 996 [2018-10-27 00:30:08,407 INFO L226 Difference]: Without dead ends: 749 [2018-10-27 00:30:08,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-10-27 00:30:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2018-10-27 00:30:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-10-27 00:30:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1062 transitions. [2018-10-27 00:30:08,430 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1062 transitions. Word has length 101 [2018-10-27 00:30:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:08,430 INFO L481 AbstractCegarLoop]: Abstraction has 749 states and 1062 transitions. [2018-10-27 00:30:08,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1062 transitions. [2018-10-27 00:30:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:30:08,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:08,434 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:08,434 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:08,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1918858680, now seen corresponding path program 1 times [2018-10-27 00:30:08,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:08,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:08,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:30:08,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:08,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:08,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:08,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:08,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:08,551 INFO L87 Difference]: Start difference. First operand 749 states and 1062 transitions. Second operand 3 states. [2018-10-27 00:30:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:08,836 INFO L93 Difference]: Finished difference Result 996 states and 1414 transitions. [2018-10-27 00:30:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:08,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-10-27 00:30:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:08,843 INFO L225 Difference]: With dead ends: 996 [2018-10-27 00:30:08,844 INFO L226 Difference]: Without dead ends: 994 [2018-10-27 00:30:08,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:08,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-10-27 00:30:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2018-10-27 00:30:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-10-27 00:30:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1412 transitions. [2018-10-27 00:30:08,869 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1412 transitions. Word has length 103 [2018-10-27 00:30:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:08,871 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1412 transitions. [2018-10-27 00:30:08,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1412 transitions. [2018-10-27 00:30:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-27 00:30:08,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:08,873 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:08,873 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1984812912, now seen corresponding path program 1 times [2018-10-27 00:30:08,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:08,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:30:08,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:08,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:08,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:08,980 INFO L87 Difference]: Start difference. First operand 994 states and 1412 transitions. Second operand 3 states. [2018-10-27 00:30:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:09,173 INFO L93 Difference]: Finished difference Result 2086 states and 2982 transitions. [2018-10-27 00:30:09,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:09,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2018-10-27 00:30:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:09,183 INFO L225 Difference]: With dead ends: 2086 [2018-10-27 00:30:09,183 INFO L226 Difference]: Without dead ends: 1104 [2018-10-27 00:30:09,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2018-10-27 00:30:09,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1090. [2018-10-27 00:30:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-10-27 00:30:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1528 transitions. [2018-10-27 00:30:09,209 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1528 transitions. Word has length 129 [2018-10-27 00:30:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:09,209 INFO L481 AbstractCegarLoop]: Abstraction has 1090 states and 1528 transitions. [2018-10-27 00:30:09,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1528 transitions. [2018-10-27 00:30:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:30:09,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:09,213 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:09,213 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:09,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash -2074477414, now seen corresponding path program 1 times [2018-10-27 00:30:09,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:09,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:09,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:09,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-27 00:30:09,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:09,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:09,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:09,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:09,306 INFO L87 Difference]: Start difference. First operand 1090 states and 1528 transitions. Second operand 3 states. [2018-10-27 00:30:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:09,913 INFO L93 Difference]: Finished difference Result 2376 states and 3384 transitions. [2018-10-27 00:30:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:09,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-27 00:30:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:09,920 INFO L225 Difference]: With dead ends: 2376 [2018-10-27 00:30:09,920 INFO L226 Difference]: Without dead ends: 1290 [2018-10-27 00:30:09,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-27 00:30:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1250. [2018-10-27 00:30:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2018-10-27 00:30:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1756 transitions. [2018-10-27 00:30:09,949 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1756 transitions. Word has length 151 [2018-10-27 00:30:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:09,949 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1756 transitions. [2018-10-27 00:30:09,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1756 transitions. [2018-10-27 00:30:09,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 00:30:09,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:09,954 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:09,954 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -53614923, now seen corresponding path program 1 times [2018-10-27 00:30:09,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-27 00:30:10,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:10,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:10,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:10,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:10,073 INFO L87 Difference]: Start difference. First operand 1250 states and 1756 transitions. Second operand 3 states. [2018-10-27 00:30:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:10,264 INFO L93 Difference]: Finished difference Result 2612 states and 3644 transitions. [2018-10-27 00:30:10,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:10,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-27 00:30:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:10,271 INFO L225 Difference]: With dead ends: 2612 [2018-10-27 00:30:10,272 INFO L226 Difference]: Without dead ends: 1374 [2018-10-27 00:30:10,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2018-10-27 00:30:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1366. [2018-10-27 00:30:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2018-10-27 00:30:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1892 transitions. [2018-10-27 00:30:10,302 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1892 transitions. Word has length 188 [2018-10-27 00:30:10,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:10,302 INFO L481 AbstractCegarLoop]: Abstraction has 1366 states and 1892 transitions. [2018-10-27 00:30:10,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1892 transitions. [2018-10-27 00:30:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 00:30:10,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:10,306 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:10,307 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:10,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1907959735, now seen corresponding path program 1 times [2018-10-27 00:30:10,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:10,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:10,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-27 00:30:10,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:10,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:10,413 INFO L87 Difference]: Start difference. First operand 1366 states and 1892 transitions. Second operand 3 states. [2018-10-27 00:30:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:10,845 INFO L93 Difference]: Finished difference Result 2860 states and 3952 transitions. [2018-10-27 00:30:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:10,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-27 00:30:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:10,850 INFO L225 Difference]: With dead ends: 2860 [2018-10-27 00:30:10,850 INFO L226 Difference]: Without dead ends: 1506 [2018-10-27 00:30:10,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2018-10-27 00:30:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1494. [2018-10-27 00:30:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2018-10-27 00:30:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2040 transitions. [2018-10-27 00:30:10,880 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2040 transitions. Word has length 188 [2018-10-27 00:30:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:10,880 INFO L481 AbstractCegarLoop]: Abstraction has 1494 states and 2040 transitions. [2018-10-27 00:30:10,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2040 transitions. [2018-10-27 00:30:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 00:30:10,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:10,885 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:10,885 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:10,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash 340460485, now seen corresponding path program 1 times [2018-10-27 00:30:10,886 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:10,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:10,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:10,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-10-27 00:30:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:10,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:10,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:10,963 INFO L87 Difference]: Start difference. First operand 1494 states and 2040 transitions. Second operand 3 states. [2018-10-27 00:30:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:11,070 INFO L93 Difference]: Finished difference Result 4454 states and 6084 transitions. [2018-10-27 00:30:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:11,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-27 00:30:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:11,078 INFO L225 Difference]: With dead ends: 4454 [2018-10-27 00:30:11,079 INFO L226 Difference]: Without dead ends: 2972 [2018-10-27 00:30:11,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:11,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2018-10-27 00:30:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2970. [2018-10-27 00:30:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2970 states. [2018-10-27 00:30:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2970 states to 2970 states and 4055 transitions. [2018-10-27 00:30:11,135 INFO L78 Accepts]: Start accepts. Automaton has 2970 states and 4055 transitions. Word has length 219 [2018-10-27 00:30:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:11,136 INFO L481 AbstractCegarLoop]: Abstraction has 2970 states and 4055 transitions. [2018-10-27 00:30:11,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2970 states and 4055 transitions. [2018-10-27 00:30:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-27 00:30:11,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:11,143 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:11,143 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:11,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1992932153, now seen corresponding path program 1 times [2018-10-27 00:30:11,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:11,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:11,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-10-27 00:30:11,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:11,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:11,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:11,294 INFO L87 Difference]: Start difference. First operand 2970 states and 4055 transitions. Second operand 3 states. [2018-10-27 00:30:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:11,670 INFO L93 Difference]: Finished difference Result 6236 states and 8514 transitions. [2018-10-27 00:30:11,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:11,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-27 00:30:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:11,680 INFO L225 Difference]: With dead ends: 6236 [2018-10-27 00:30:11,680 INFO L226 Difference]: Without dead ends: 3278 [2018-10-27 00:30:11,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3278 states. [2018-10-27 00:30:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3278 to 3262. [2018-10-27 00:30:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2018-10-27 00:30:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4387 transitions. [2018-10-27 00:30:11,739 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4387 transitions. Word has length 219 [2018-10-27 00:30:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:11,739 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 4387 transitions. [2018-10-27 00:30:11,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4387 transitions. [2018-10-27 00:30:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-27 00:30:11,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:11,747 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:11,747 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:11,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1255885273, now seen corresponding path program 1 times [2018-10-27 00:30:11,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:11,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-10-27 00:30:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:11,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:11,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:11,860 INFO L87 Difference]: Start difference. First operand 3262 states and 4387 transitions. Second operand 3 states. [2018-10-27 00:30:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:11,983 INFO L93 Difference]: Finished difference Result 6664 states and 8958 transitions. [2018-10-27 00:30:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:11,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-27 00:30:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:11,992 INFO L225 Difference]: With dead ends: 6664 [2018-10-27 00:30:11,992 INFO L226 Difference]: Without dead ends: 3414 [2018-10-27 00:30:11,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3414 states. [2018-10-27 00:30:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3414 to 3398. [2018-10-27 00:30:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3398 states. [2018-10-27 00:30:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4543 transitions. [2018-10-27 00:30:12,049 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4543 transitions. Word has length 244 [2018-10-27 00:30:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:12,049 INFO L481 AbstractCegarLoop]: Abstraction has 3398 states and 4543 transitions. [2018-10-27 00:30:12,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4543 transitions. [2018-10-27 00:30:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-27 00:30:12,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:12,057 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:12,057 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:12,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1251056548, now seen corresponding path program 1 times [2018-10-27 00:30:12,057 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:12,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-27 00:30:12,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:12,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:12,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:12,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:12,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:12,198 INFO L87 Difference]: Start difference. First operand 3398 states and 4543 transitions. Second operand 3 states. [2018-10-27 00:30:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:12,400 INFO L93 Difference]: Finished difference Result 7192 states and 9750 transitions. [2018-10-27 00:30:12,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:12,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-10-27 00:30:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:12,413 INFO L225 Difference]: With dead ends: 7192 [2018-10-27 00:30:12,413 INFO L226 Difference]: Without dead ends: 3806 [2018-10-27 00:30:12,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2018-10-27 00:30:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 3718. [2018-10-27 00:30:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2018-10-27 00:30:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 4919 transitions. [2018-10-27 00:30:12,473 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 4919 transitions. Word has length 255 [2018-10-27 00:30:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:12,474 INFO L481 AbstractCegarLoop]: Abstraction has 3718 states and 4919 transitions. [2018-10-27 00:30:12,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 4919 transitions. [2018-10-27 00:30:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-27 00:30:12,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:12,482 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:12,482 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:12,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:12,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1320979294, now seen corresponding path program 1 times [2018-10-27 00:30:12,484 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:12,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:12,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:12,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-27 00:30:12,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:12,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:12,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:12,608 INFO L87 Difference]: Start difference. First operand 3718 states and 4919 transitions. Second operand 3 states. [2018-10-27 00:30:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:13,195 INFO L93 Difference]: Finished difference Result 7840 states and 10310 transitions. [2018-10-27 00:30:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:13,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2018-10-27 00:30:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:13,217 INFO L225 Difference]: With dead ends: 7840 [2018-10-27 00:30:13,221 INFO L226 Difference]: Without dead ends: 4134 [2018-10-27 00:30:13,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4134 states. [2018-10-27 00:30:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4134 to 3846. [2018-10-27 00:30:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3846 states. [2018-10-27 00:30:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5071 transitions. [2018-10-27 00:30:13,292 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5071 transitions. Word has length 270 [2018-10-27 00:30:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:13,293 INFO L481 AbstractCegarLoop]: Abstraction has 3846 states and 5071 transitions. [2018-10-27 00:30:13,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5071 transitions. [2018-10-27 00:30:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-27 00:30:13,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:13,301 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:13,302 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:13,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2043197932, now seen corresponding path program 1 times [2018-10-27 00:30:13,302 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:13,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:13,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:13,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-27 00:30:13,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:13,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:13,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:13,494 INFO L87 Difference]: Start difference. First operand 3846 states and 5071 transitions. Second operand 3 states. [2018-10-27 00:30:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:13,682 INFO L93 Difference]: Finished difference Result 10994 states and 14573 transitions. [2018-10-27 00:30:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:13,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-10-27 00:30:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:13,694 INFO L225 Difference]: With dead ends: 10994 [2018-10-27 00:30:13,695 INFO L226 Difference]: Without dead ends: 7160 [2018-10-27 00:30:13,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:13,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7160 states. [2018-10-27 00:30:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7160 to 7158. [2018-10-27 00:30:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7158 states. [2018-10-27 00:30:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7158 states to 7158 states and 9493 transitions. [2018-10-27 00:30:13,795 INFO L78 Accepts]: Start accepts. Automaton has 7158 states and 9493 transitions. Word has length 271 [2018-10-27 00:30:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:13,795 INFO L481 AbstractCegarLoop]: Abstraction has 7158 states and 9493 transitions. [2018-10-27 00:30:13,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 7158 states and 9493 transitions. [2018-10-27 00:30:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-27 00:30:13,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:13,807 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:13,807 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:13,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2027340829, now seen corresponding path program 1 times [2018-10-27 00:30:13,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:13,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:13,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-10-27 00:30:13,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:13,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:13,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:13,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:13,917 INFO L87 Difference]: Start difference. First operand 7158 states and 9493 transitions. Second operand 3 states. [2018-10-27 00:30:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:14,461 INFO L93 Difference]: Finished difference Result 14312 states and 18962 transitions. [2018-10-27 00:30:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:14,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2018-10-27 00:30:14,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:14,483 INFO L225 Difference]: With dead ends: 14312 [2018-10-27 00:30:14,483 INFO L226 Difference]: Without dead ends: 7166 [2018-10-27 00:30:14,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2018-10-27 00:30:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 7134. [2018-10-27 00:30:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7134 states. [2018-10-27 00:30:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9277 transitions. [2018-10-27 00:30:14,586 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9277 transitions. Word has length 272 [2018-10-27 00:30:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:14,586 INFO L481 AbstractCegarLoop]: Abstraction has 7134 states and 9277 transitions. [2018-10-27 00:30:14,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9277 transitions. [2018-10-27 00:30:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-27 00:30:14,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:14,595 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:14,595 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:14,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash -517836981, now seen corresponding path program 1 times [2018-10-27 00:30:14,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:14,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:14,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:14,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:14,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 336 proven. 19 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2018-10-27 00:30:14,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:30:14,835 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/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-10-27 00:30:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:14,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:30:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 917 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2018-10-27 00:30:15,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:30:15,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-10-27 00:30:15,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 00:30:15,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 00:30:15,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 00:30:15,278 INFO L87 Difference]: Start difference. First operand 7134 states and 9277 transitions. Second operand 6 states. [2018-10-27 00:30:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:19,317 INFO L93 Difference]: Finished difference Result 17861 states and 23235 transitions. [2018-10-27 00:30:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:30:19,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2018-10-27 00:30:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:19,341 INFO L225 Difference]: With dead ends: 17861 [2018-10-27 00:30:19,341 INFO L226 Difference]: Without dead ends: 10703 [2018-10-27 00:30:19,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-10-27 00:30:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2018-10-27 00:30:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 9101. [2018-10-27 00:30:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9101 states. [2018-10-27 00:30:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9101 states to 9101 states and 11840 transitions. [2018-10-27 00:30:19,599 INFO L78 Accepts]: Start accepts. Automaton has 9101 states and 11840 transitions. Word has length 295 [2018-10-27 00:30:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:19,600 INFO L481 AbstractCegarLoop]: Abstraction has 9101 states and 11840 transitions. [2018-10-27 00:30:19,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 00:30:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9101 states and 11840 transitions. [2018-10-27 00:30:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-27 00:30:19,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:19,618 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:19,618 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:19,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:19,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1202097003, now seen corresponding path program 1 times [2018-10-27 00:30:19,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:19,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:19,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 439 proven. 6 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2018-10-27 00:30:19,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:30:19,934 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 00:30:19,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:30:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:20,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:30:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2018-10-27 00:30:20,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 00:30:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-27 00:30:20,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:30:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:30:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:30:20,223 INFO L87 Difference]: Start difference. First operand 9101 states and 11840 transitions. Second operand 5 states. [2018-10-27 00:30:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:21,447 INFO L93 Difference]: Finished difference Result 21019 states and 27227 transitions. [2018-10-27 00:30:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 00:30:21,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2018-10-27 00:30:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:21,466 INFO L225 Difference]: With dead ends: 21019 [2018-10-27 00:30:21,467 INFO L226 Difference]: Without dead ends: 11929 [2018-10-27 00:30:21,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 00:30:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11929 states. [2018-10-27 00:30:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11929 to 9984. [2018-10-27 00:30:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9984 states. [2018-10-27 00:30:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9984 states to 9984 states and 12699 transitions. [2018-10-27 00:30:21,693 INFO L78 Accepts]: Start accepts. Automaton has 9984 states and 12699 transitions. Word has length 323 [2018-10-27 00:30:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:21,693 INFO L481 AbstractCegarLoop]: Abstraction has 9984 states and 12699 transitions. [2018-10-27 00:30:21,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:30:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 9984 states and 12699 transitions. [2018-10-27 00:30:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-27 00:30:21,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:21,707 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:21,709 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1251688620, now seen corresponding path program 1 times [2018-10-27 00:30:21,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2122 backedges. 961 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-27 00:30:21,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:30:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:30:21,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:30:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:30:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:30:21,883 INFO L87 Difference]: Start difference. First operand 9984 states and 12699 transitions. Second operand 3 states. [2018-10-27 00:30:22,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:22,745 INFO L93 Difference]: Finished difference Result 18887 states and 23778 transitions. [2018-10-27 00:30:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:30:22,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 434 [2018-10-27 00:30:22,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:22,751 INFO L225 Difference]: With dead ends: 18887 [2018-10-27 00:30:22,751 INFO L226 Difference]: Without dead ends: 3997 [2018-10-27 00:30:22,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-10-27 00:30:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2018-10-27 00:30:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3644. [2018-10-27 00:30:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3644 states. [2018-10-27 00:30:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 4510 transitions. [2018-10-27 00:30:22,824 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 4510 transitions. Word has length 434 [2018-10-27 00:30:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:22,824 INFO L481 AbstractCegarLoop]: Abstraction has 3644 states and 4510 transitions. [2018-10-27 00:30:22,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:30:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4510 transitions. [2018-10-27 00:30:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-27 00:30:22,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:30:22,831 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:30:22,831 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:30:22,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:30:22,832 INFO L82 PathProgramCache]: Analyzing trace with hash 696372751, now seen corresponding path program 1 times [2018-10-27 00:30:22,833 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 00:30:22,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 00:30:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:22,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:30:22,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:30:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-10-27 00:30:23,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:30:23,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 00:30:23,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:30:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:30:23,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:30:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 1359 proven. 15 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2018-10-27 00:30:23,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:30:23,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-27 00:30:23,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 00:30:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 00:30:23,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 00:30:23,410 INFO L87 Difference]: Start difference. First operand 3644 states and 4510 transitions. Second operand 4 states. [2018-10-27 00:30:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:30:23,626 INFO L93 Difference]: Finished difference Result 4153 states and 5148 transitions. [2018-10-27 00:30:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 00:30:23,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 463 [2018-10-27 00:30:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:30:23,627 INFO L225 Difference]: With dead ends: 4153 [2018-10-27 00:30:23,627 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 00:30:23,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:30:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 00:30:23,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 00:30:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 00:30:23,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 00:30:23,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 463 [2018-10-27 00:30:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:30:23,632 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 00:30:23,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 00:30:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 00:30:23,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 00:30:23,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 00:30:23,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:23,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,051 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 68 [2018-10-27 00:30:24,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 00:30:24,651 WARN L179 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-10-27 00:30:24,791 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-27 00:30:25,422 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2018-10-27 00:30:25,520 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2018-10-27 00:30:25,520 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L421 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-10-27 00:30:25,521 INFO L428 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L421 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0))) [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2018-10-27 00:30:25,521 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L421 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L421 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2018-10-27 00:30:25,522 INFO L425 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L421 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L421 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2018-10-27 00:30:25,523 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L421 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2))) [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L421 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1) (and .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse4) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse5 .cse2) (and (= ssl3_connect_~s__state~0 4464) .cse2) (< |ssl3_connect_#in~initial_state| 12292) (and .cse6 .cse3 .cse4 .cse2 .cse7) (and .cse6 .cse8 .cse2 .cse9 .cse7) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse0 .cse8 .cse9) (and (<= ssl3_connect_~s__state~0 3) .cse6) (and .cse0 .cse5) (and .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,524 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L421 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-10-27 00:30:25,525 INFO L421 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse2 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse0 .cse1))) [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2018-10-27 00:30:25,525 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 200 481) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 200 481) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2018-10-27 00:30:25,526 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L421 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2))) [2018-10-27 00:30:25,527 INFO L421 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2018-10-27 00:30:25,527 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L421 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2018-10-27 00:30:25,528 INFO L421 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0) (<= 4464 ssl3_connect_~s__state~0))) [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 533) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L97-2(lines 75 545) no Hoare annotation was computed. [2018-10-27 00:30:25,528 INFO L425 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L428 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2018-10-27 00:30:25,529 INFO L421 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2018-10-27 00:30:25,529 INFO L425 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L421 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2018-10-27 00:30:25,530 INFO L421 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0)))) [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-27 00:30:25,530 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:30:25,530 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2018-10-27 00:30:25,530 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2018-10-27 00:30:25,531 INFO L428 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2018-10-27 00:30:25,531 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2018-10-27 00:30:25,531 INFO L425 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2018-10-27 00:30:25,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:30:25 BoogieIcfgContainer [2018-10-27 00:30:25,549 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:30:25,549 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:30:25,549 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:30:25,549 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:30:25,550 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:30:05" (3/4) ... [2018-10-27 00:30:25,553 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 00:30:25,558 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 00:30:25,559 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-27 00:30:25,559 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 00:30:25,567 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-27 00:30:25,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-27 00:30:25,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 00:30:25,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) [2018-10-27 00:30:25,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || (s__state == 4512 && s__hit == 0)) || (s__state == 4464 && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 4 && s__hit == 0) [2018-10-27 00:30:25,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__state <= 4560 && s__hit == 0) && 4464 <= s__state) [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) [2018-10-27 00:30:25,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) [2018-10-27 00:30:25,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) [2018-10-27 00:30:25,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) [2018-10-27 00:30:25,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) [2018-10-27 00:30:25,671 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_effbe0dc-1717-4c3a-8043-8cd959b8395c/bin-2019/uautomizer/witness.graphml [2018-10-27 00:30:25,671 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:30:25,672 INFO L168 Benchmark]: Toolchain (without parser) took 22122.46 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 621.8 MB). Free memory was 959.8 MB in the beginning and 1.4 GB in the end (delta: -444.1 MB). Peak memory consumption was 177.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,672 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:30:25,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 943.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,672 INFO L168 Benchmark]: Boogie Preprocessor took 55.54 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,673 INFO L168 Benchmark]: RCFGBuilder took 1079.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,673 INFO L168 Benchmark]: TraceAbstraction took 20532.94 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 479.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -325.0 MB). Peak memory consumption was 587.3 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,673 INFO L168 Benchmark]: Witness Printer took 121.83 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-10-27 00:30:25,674 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 943.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.54 ms. Allocated memory is still 1.0 GB. Free memory was 943.7 MB in the beginning and 941.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1079.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -152.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20532.94 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 479.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -325.0 MB). Peak memory consumption was 587.3 MB. Max. memory is 11.5 GB. * Witness Printer took 121.83 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((s__state <= 4560 && s__hit == 0) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (blastFlag <= 2 && s__state == 4384)) || (s__state == 4512 && s__hit == 0)) || (s__state == 4464 && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || (((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 20.4s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4704 SDtfs, 1842 SDslu, 2971 SDs, 0 SdLazy, 2725 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1165 GetRequests, 1128 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9984occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 4484 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 341 NumberOfFragments, 518 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21934 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 909 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 5564 NumberOfCodeBlocks, 5564 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5538 ConstructedInterpolants, 0 QuantifiedInterpolants, 2012116 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2010 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 16932/16987 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...