./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b2fdeede7b1203b845c20c562beaee69c29ce3b ...................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 04:53:19,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:53:19,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:53:19,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:53:19,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:53:19,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:53:19,193 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:53:19,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:53:19,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:53:19,195 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:53:19,196 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:53:19,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:53:19,196 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:53:19,197 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:53:19,198 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:53:19,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:53:19,198 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:53:19,199 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:53:19,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:53:19,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:53:19,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:53:19,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:53:19,203 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:53:19,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:53:19,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:53:19,204 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:53:19,205 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:53:19,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:53:19,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:53:19,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:53:19,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:53:19,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:53:19,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:53:19,207 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:53:19,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:53:19,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:53:19,208 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 04:53:19,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:53:19,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:53:19,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:53:19,216 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:53:19,216 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:53:19,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:53:19,216 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:53:19,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:53:19,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:53:19,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:53:19,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:53:19,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:53:19,219 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-12-03 04:53:19,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:53:19,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:53:19,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:53:19,247 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:53:19,248 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:53:19,248 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-03 04:53:19,285 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/4cd7d900f/ed68bde3e6d64d15a3e391a50a997245/FLAGd91c09da8 [2018-12-03 04:53:19,742 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:53:19,743 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-03 04:53:19,751 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/4cd7d900f/ed68bde3e6d64d15a3e391a50a997245/FLAGd91c09da8 [2018-12-03 04:53:19,759 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/4cd7d900f/ed68bde3e6d64d15a3e391a50a997245 [2018-12-03 04:53:19,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:53:19,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:53:19,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:53:19,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:53:19,764 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:53:19,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:53:19" (1/1) ... [2018-12-03 04:53:19,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f103c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:19, skipping insertion in model container [2018-12-03 04:53:19,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:53:19" (1/1) ... [2018-12-03 04:53:19,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:53:19,795 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:53:20,031 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:53:20,040 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:53:20,092 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:53:20,103 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:53:20,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20 WrapperNode [2018-12-03 04:53:20,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:53:20,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:53:20,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:53:20,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:53:20,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:53:20,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:53:20,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:53:20,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:53:20,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... [2018-12-03 04:53:20,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:53:20,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:53:20,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:53:20,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:53:20,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 04:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 04:53:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 04:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 04:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 04:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 04:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-03 04:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-03 04:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:53:20,426 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 04:53:20,427 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 04:53:20,778 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:53:20,778 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 04:53:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:53:20 BoogieIcfgContainer [2018-12-03 04:53:20,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:53:20,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:53:20,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:53:20,782 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:53:20,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:53:19" (1/3) ... [2018-12-03 04:53:20,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3772d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:53:20, skipping insertion in model container [2018-12-03 04:53:20,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:20" (2/3) ... [2018-12-03 04:53:20,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3772d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:53:20, skipping insertion in model container [2018-12-03 04:53:20,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:53:20" (3/3) ... [2018-12-03 04:53:20,784 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-03 04:53:20,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:53:20,799 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 04:53:20,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 04:53:20,832 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:53:20,832 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:53:20,833 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:53:20,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:53:20,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:53:20,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:53:20,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:53:20,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:53:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-03 04:53:20,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 04:53:20,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:20,851 INFO L402 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-12-03 04:53:20,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:20,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-12-03 04:53:20,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:20,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:20,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:20,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:20,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:53:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:21,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:53:21,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:21,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:53:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:53:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:53:21,041 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-03 04:53:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:21,103 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-12-03 04:53:21,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:53:21,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 04:53:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:21,112 INFO L225 Difference]: With dead ends: 385 [2018-12-03 04:53:21,112 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 04:53:21,115 INFO L631 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-12-03 04:53:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 04:53:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-03 04:53:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-03 04:53:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-12-03 04:53:21,153 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-12-03 04:53:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-12-03 04:53:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:53:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-12-03 04:53:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 04:53:21,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:21,155 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-03 04:53:21,156 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-12-03 04:53:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 04:53:21,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:21,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:53:21,221 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:21,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:53:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:53:21,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:53:21,222 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-12-03 04:53:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:21,267 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-12-03 04:53:21,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:53:21,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 04:53:21,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:21,270 INFO L225 Difference]: With dead ends: 432 [2018-12-03 04:53:21,270 INFO L226 Difference]: Without dead ends: 325 [2018-12-03 04:53:21,271 INFO L631 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-12-03 04:53:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-03 04:53:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-12-03 04:53:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 04:53:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-12-03 04:53:21,292 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-12-03 04:53:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:21,292 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-12-03 04:53:21,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:53:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-12-03 04:53:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 04:53:21,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:21,295 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:21,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:21,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-12-03 04:53:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:21,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:21,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:21,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:21,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:21,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:21,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:21,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:21,422 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-12-03 04:53:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:21,721 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-12-03 04:53:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:21,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-03 04:53:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:21,723 INFO L225 Difference]: With dead ends: 825 [2018-12-03 04:53:21,723 INFO L226 Difference]: Without dead ends: 513 [2018-12-03 04:53:21,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-03 04:53:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-12-03 04:53:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-03 04:53:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-12-03 04:53:21,739 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-12-03 04:53:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:21,740 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-12-03 04:53:21,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-12-03 04:53:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 04:53:21,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:21,742 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:21,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:21,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1956647801, now seen corresponding path program 1 times [2018-12-03 04:53:21,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:21,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:21,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:21,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:21,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:21,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:21,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:21,812 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-12-03 04:53:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:22,012 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-12-03 04:53:22,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:22,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-03 04:53:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:22,014 INFO L225 Difference]: With dead ends: 821 [2018-12-03 04:53:22,014 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 04:53:22,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 04:53:22,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-12-03 04:53:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-03 04:53:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-12-03 04:53:22,025 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-12-03 04:53:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:22,025 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-12-03 04:53:22,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-12-03 04:53:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 04:53:22,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:22,026 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 04:53:22,027 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:22,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -671506196, now seen corresponding path program 1 times [2018-12-03 04:53:22,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:22,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:22,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:22,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:22,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:22,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:22,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:22,078 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-12-03 04:53:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:22,358 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2018-12-03 04:53:22,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:22,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-03 04:53:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:22,360 INFO L225 Difference]: With dead ends: 949 [2018-12-03 04:53:22,360 INFO L226 Difference]: Without dead ends: 547 [2018-12-03 04:53:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-03 04:53:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2018-12-03 04:53:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-03 04:53:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-12-03 04:53:22,368 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-12-03 04:53:22,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:22,368 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-12-03 04:53:22,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-12-03 04:53:22,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 04:53:22,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:22,369 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 04:53:22,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:22,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:22,369 INFO L82 PathProgramCache]: Analyzing trace with hash 653887364, now seen corresponding path program 1 times [2018-12-03 04:53:22,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:22,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:22,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:22,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:22,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:22,411 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:22,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:22,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:22,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:22,412 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-12-03 04:53:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:22,676 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2018-12-03 04:53:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:22,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 04:53:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:22,678 INFO L225 Difference]: With dead ends: 951 [2018-12-03 04:53:22,678 INFO L226 Difference]: Without dead ends: 547 [2018-12-03 04:53:22,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-03 04:53:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2018-12-03 04:53:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 04:53:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-12-03 04:53:22,687 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2018-12-03 04:53:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-12-03 04:53:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-12-03 04:53:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 04:53:22,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:22,688 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 04:53:22,688 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:22,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:22,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1208805305, now seen corresponding path program 1 times [2018-12-03 04:53:22,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:22,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:22,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:22,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:22,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:22,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:22,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:22,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:22,726 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-12-03 04:53:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:23,006 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2018-12-03 04:53:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:23,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 04:53:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:23,008 INFO L225 Difference]: With dead ends: 943 [2018-12-03 04:53:23,008 INFO L226 Difference]: Without dead ends: 537 [2018-12-03 04:53:23,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-03 04:53:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2018-12-03 04:53:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2018-12-03 04:53:23,018 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2018-12-03 04:53:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:23,018 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2018-12-03 04:53:23,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2018-12-03 04:53:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:23,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:23,019 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1] [2018-12-03 04:53:23,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:23,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -784316286, now seen corresponding path program 1 times [2018-12-03 04:53:23,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:23,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:23,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:23,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:23,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:23,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:23,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:23,068 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2018-12-03 04:53:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:23,326 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2018-12-03 04:53:23,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:23,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:23,328 INFO L225 Difference]: With dead ends: 943 [2018-12-03 04:53:23,328 INFO L226 Difference]: Without dead ends: 535 [2018-12-03 04:53:23,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-03 04:53:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-03 04:53:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2018-12-03 04:53:23,336 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2018-12-03 04:53:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:23,336 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2018-12-03 04:53:23,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2018-12-03 04:53:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:23,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:23,337 INFO L402 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, 1] [2018-12-03 04:53:23,337 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:23,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -802971744, now seen corresponding path program 1 times [2018-12-03 04:53:23,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:23,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:23,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:23,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:23,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:23,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:23,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:23,374 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2018-12-03 04:53:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:23,621 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2018-12-03 04:53:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:23,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:23,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:23,622 INFO L225 Difference]: With dead ends: 943 [2018-12-03 04:53:23,622 INFO L226 Difference]: Without dead ends: 535 [2018-12-03 04:53:23,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-03 04:53:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-03 04:53:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2018-12-03 04:53:23,630 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2018-12-03 04:53:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:23,630 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2018-12-03 04:53:23,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2018-12-03 04:53:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:23,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:23,631 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-03 04:53:23,631 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:23,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1508472381, now seen corresponding path program 1 times [2018-12-03 04:53:23,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:23,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:23,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:23,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:23,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:23,664 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2018-12-03 04:53:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:23,924 INFO L93 Difference]: Finished difference Result 794 states and 1181 transitions. [2018-12-03 04:53:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:23,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:23,926 INFO L225 Difference]: With dead ends: 794 [2018-12-03 04:53:23,926 INFO L226 Difference]: Without dead ends: 535 [2018-12-03 04:53:23,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-03 04:53:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-03 04:53:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2018-12-03 04:53:23,935 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2018-12-03 04:53:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:23,936 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2018-12-03 04:53:23,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2018-12-03 04:53:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:23,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:23,937 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1] [2018-12-03 04:53:23,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:23,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1665283844, now seen corresponding path program 1 times [2018-12-03 04:53:23,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:23,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:23,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:23,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:23,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:23,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:23,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:23,977 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2018-12-03 04:53:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:24,161 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2018-12-03 04:53:24,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:24,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:24,163 INFO L225 Difference]: With dead ends: 871 [2018-12-03 04:53:24,163 INFO L226 Difference]: Without dead ends: 463 [2018-12-03 04:53:24,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-03 04:53:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-03 04:53:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-12-03 04:53:24,176 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2018-12-03 04:53:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:24,176 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-12-03 04:53:24,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-12-03 04:53:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:24,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:24,177 INFO L402 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, 1] [2018-12-03 04:53:24,178 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:24,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1646628386, now seen corresponding path program 1 times [2018-12-03 04:53:24,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:24,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:24,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:24,230 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-12-03 04:53:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:24,395 INFO L93 Difference]: Finished difference Result 871 states and 1292 transitions. [2018-12-03 04:53:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:24,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:24,396 INFO L225 Difference]: With dead ends: 871 [2018-12-03 04:53:24,396 INFO L226 Difference]: Without dead ends: 463 [2018-12-03 04:53:24,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-03 04:53:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-03 04:53:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2018-12-03 04:53:24,403 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2018-12-03 04:53:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:24,403 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2018-12-03 04:53:24,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2018-12-03 04:53:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 04:53:24,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:24,404 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-03 04:53:24,404 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:24,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:24,404 INFO L82 PathProgramCache]: Analyzing trace with hash 941127749, now seen corresponding path program 1 times [2018-12-03 04:53:24,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:24,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:24,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:24,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:24,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:24,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:24,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:24,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:24,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:24,438 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2018-12-03 04:53:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:24,618 INFO L93 Difference]: Finished difference Result 722 states and 1065 transitions. [2018-12-03 04:53:24,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:24,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-03 04:53:24,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:24,620 INFO L225 Difference]: With dead ends: 722 [2018-12-03 04:53:24,620 INFO L226 Difference]: Without dead ends: 463 [2018-12-03 04:53:24,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-03 04:53:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-03 04:53:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2018-12-03 04:53:24,632 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2018-12-03 04:53:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:24,632 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2018-12-03 04:53:24,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2018-12-03 04:53:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 04:53:24,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:24,634 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2018-12-03 04:53:24,634 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1290131619, now seen corresponding path program 1 times [2018-12-03 04:53:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:24,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:24,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:24,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:24,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:24,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:24,683 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2018-12-03 04:53:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:24,926 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2018-12-03 04:53:24,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:24,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-03 04:53:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:24,928 INFO L225 Difference]: With dead ends: 943 [2018-12-03 04:53:24,928 INFO L226 Difference]: Without dead ends: 535 [2018-12-03 04:53:24,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-03 04:53:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-03 04:53:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2018-12-03 04:53:24,941 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2018-12-03 04:53:24,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:24,941 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2018-12-03 04:53:24,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2018-12-03 04:53:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 04:53:24,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:24,943 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 04:53:24,943 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:24,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 765876928, now seen corresponding path program 1 times [2018-12-03 04:53:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:24,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:24,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:24,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:24,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:24,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:24,989 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2018-12-03 04:53:25,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:25,234 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2018-12-03 04:53:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:25,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-03 04:53:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:25,236 INFO L225 Difference]: With dead ends: 788 [2018-12-03 04:53:25,236 INFO L226 Difference]: Without dead ends: 529 [2018-12-03 04:53:25,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-03 04:53:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-03 04:53:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2018-12-03 04:53:25,250 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2018-12-03 04:53:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:25,250 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2018-12-03 04:53:25,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2018-12-03 04:53:25,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 04:53:25,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:25,252 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1] [2018-12-03 04:53:25,252 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:25,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1633028379, now seen corresponding path program 1 times [2018-12-03 04:53:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:25,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:25,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:25,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:25,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:25,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:25,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:25,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:25,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:25,300 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2018-12-03 04:53:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:25,450 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2018-12-03 04:53:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:25,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-03 04:53:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:25,452 INFO L225 Difference]: With dead ends: 871 [2018-12-03 04:53:25,452 INFO L226 Difference]: Without dead ends: 463 [2018-12-03 04:53:25,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-03 04:53:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-03 04:53:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2018-12-03 04:53:25,459 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2018-12-03 04:53:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:25,459 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2018-12-03 04:53:25,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-12-03 04:53:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 04:53:25,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:25,460 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-12-03 04:53:25,460 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:25,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:25,461 INFO L82 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2018-12-03 04:53:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:25,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:25,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:25,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:25,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:25,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:25,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:25,493 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2018-12-03 04:53:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:25,653 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2018-12-03 04:53:25,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:25,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-03 04:53:25,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:25,655 INFO L225 Difference]: With dead ends: 716 [2018-12-03 04:53:25,655 INFO L226 Difference]: Without dead ends: 457 [2018-12-03 04:53:25,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-03 04:53:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-03 04:53:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2018-12-03 04:53:25,662 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2018-12-03 04:53:25,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:25,662 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2018-12-03 04:53:25,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2018-12-03 04:53:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 04:53:25,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:25,663 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1] [2018-12-03 04:53:25,663 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:25,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1753186171, now seen corresponding path program 1 times [2018-12-03 04:53:25,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:25,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:25,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:25,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:25,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:25,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:25,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:25,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:25,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:25,701 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2018-12-03 04:53:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:25,942 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2018-12-03 04:53:25,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:25,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 04:53:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:25,944 INFO L225 Difference]: With dead ends: 937 [2018-12-03 04:53:25,944 INFO L226 Difference]: Without dead ends: 529 [2018-12-03 04:53:25,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-03 04:53:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-03 04:53:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2018-12-03 04:53:25,953 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2018-12-03 04:53:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:25,954 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2018-12-03 04:53:25,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2018-12-03 04:53:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 04:53:25,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:25,955 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1] [2018-12-03 04:53:25,955 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:25,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:25,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1329539449, now seen corresponding path program 1 times [2018-12-03 04:53:25,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:25,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:25,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:25,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:26,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:26,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:26,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:26,002 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2018-12-03 04:53:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,135 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2018-12-03 04:53:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:26,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-03 04:53:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,136 INFO L225 Difference]: With dead ends: 865 [2018-12-03 04:53:26,136 INFO L226 Difference]: Without dead ends: 457 [2018-12-03 04:53:26,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:26,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-03 04:53:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-03 04:53:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2018-12-03 04:53:26,143 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2018-12-03 04:53:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,143 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2018-12-03 04:53:26,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2018-12-03 04:53:26,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 04:53:26,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,144 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:26,144 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975710, now seen corresponding path program 1 times [2018-12-03 04:53:26,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:26,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:26,174 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2018-12-03 04:53:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,375 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2018-12-03 04:53:26,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:26,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 04:53:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,376 INFO L225 Difference]: With dead ends: 919 [2018-12-03 04:53:26,376 INFO L226 Difference]: Without dead ends: 511 [2018-12-03 04:53:26,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-03 04:53:26,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-03 04:53:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2018-12-03 04:53:26,389 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2018-12-03 04:53:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,389 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2018-12-03 04:53:26,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2018-12-03 04:53:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 04:53:26,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,390 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-03 04:53:26,390 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1134564595, now seen corresponding path program 1 times [2018-12-03 04:53:26,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:26,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:26,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:26,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:26,429 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2018-12-03 04:53:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,621 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2018-12-03 04:53:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:26,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 04:53:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,623 INFO L225 Difference]: With dead ends: 919 [2018-12-03 04:53:26,623 INFO L226 Difference]: Without dead ends: 511 [2018-12-03 04:53:26,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-03 04:53:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-03 04:53:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2018-12-03 04:53:26,630 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2018-12-03 04:53:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,630 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2018-12-03 04:53:26,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2018-12-03 04:53:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 04:53:26,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,631 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:26,631 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1220829216, now seen corresponding path program 1 times [2018-12-03 04:53:26,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 04:53:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:26,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:26,659 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2018-12-03 04:53:26,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,777 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2018-12-03 04:53:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:26,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 04:53:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,779 INFO L225 Difference]: With dead ends: 847 [2018-12-03 04:53:26,779 INFO L226 Difference]: Without dead ends: 439 [2018-12-03 04:53:26,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-03 04:53:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2018-12-03 04:53:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-03 04:53:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2018-12-03 04:53:26,786 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2018-12-03 04:53:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2018-12-03 04:53:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2018-12-03 04:53:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 04:53:26,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,787 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-03 04:53:26,787 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1382711089, now seen corresponding path program 1 times [2018-12-03 04:53:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 04:53:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:53:26,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:53:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:53:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:53:26,812 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2018-12-03 04:53:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,829 INFO L93 Difference]: Finished difference Result 831 states and 1204 transitions. [2018-12-03 04:53:26,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:53:26,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-03 04:53:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,831 INFO L225 Difference]: With dead ends: 831 [2018-12-03 04:53:26,831 INFO L226 Difference]: Without dead ends: 574 [2018-12-03 04:53:26,831 INFO L631 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-12-03 04:53:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-03 04:53:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-03 04:53:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-03 04:53:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2018-12-03 04:53:26,839 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2018-12-03 04:53:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,839 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2018-12-03 04:53:26,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:53:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2018-12-03 04:53:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 04:53:26,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,840 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-03 04:53:26,840 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1024261319, now seen corresponding path program 1 times [2018-12-03 04:53:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 04:53:26,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:53:26,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:53:26,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:53:26,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:53:26,869 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2018-12-03 04:53:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,890 INFO L93 Difference]: Finished difference Result 729 states and 1052 transitions. [2018-12-03 04:53:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:53:26,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-03 04:53:26,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,891 INFO L225 Difference]: With dead ends: 729 [2018-12-03 04:53:26,891 INFO L226 Difference]: Without dead ends: 727 [2018-12-03 04:53:26,892 INFO L631 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-12-03 04:53:26,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-03 04:53:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-03 04:53:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-03 04:53:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2018-12-03 04:53:26,902 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2018-12-03 04:53:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,902 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2018-12-03 04:53:26,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:53:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2018-12-03 04:53:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 04:53:26,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,903 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:26,903 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,903 INFO L82 PathProgramCache]: Analyzing trace with hash 934069236, now seen corresponding path program 1 times [2018-12-03 04:53:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:26,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:26,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:53:26,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:26,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:53:26,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:53:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:53:26,929 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2018-12-03 04:53:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:26,956 INFO L93 Difference]: Finished difference Result 729 states and 1050 transitions. [2018-12-03 04:53:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:53:26,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-03 04:53:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:26,958 INFO L225 Difference]: With dead ends: 729 [2018-12-03 04:53:26,958 INFO L226 Difference]: Without dead ends: 727 [2018-12-03 04:53:26,959 INFO L631 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-12-03 04:53:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-03 04:53:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-03 04:53:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-03 04:53:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1048 transitions. [2018-12-03 04:53:26,974 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1048 transitions. Word has length 104 [2018-12-03 04:53:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:26,975 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1048 transitions. [2018-12-03 04:53:26,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:53:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1048 transitions. [2018-12-03 04:53:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 04:53:26,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:26,976 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:26,976 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:26,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:26,976 INFO L82 PathProgramCache]: Analyzing trace with hash -148840977, now seen corresponding path program 1 times [2018-12-03 04:53:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:26,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:26,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:26,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:27,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:27,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:27,035 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:27,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:27,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:27,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:27,036 INFO L87 Difference]: Start difference. First operand 727 states and 1048 transitions. Second operand 4 states. [2018-12-03 04:53:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:27,194 INFO L93 Difference]: Finished difference Result 1698 states and 2461 transitions. [2018-12-03 04:53:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:27,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-03 04:53:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:27,196 INFO L225 Difference]: With dead ends: 1698 [2018-12-03 04:53:27,196 INFO L226 Difference]: Without dead ends: 984 [2018-12-03 04:53:27,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2018-12-03 04:53:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 847. [2018-12-03 04:53:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 04:53:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1258 transitions. [2018-12-03 04:53:27,209 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1258 transitions. Word has length 106 [2018-12-03 04:53:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:27,209 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1258 transitions. [2018-12-03 04:53:27,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:27,209 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1258 transitions. [2018-12-03 04:53:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 04:53:27,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:27,211 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:27,211 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:27,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:27,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1084285646, now seen corresponding path program 1 times [2018-12-03 04:53:27,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:27,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:27,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:27,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:27,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:27,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:27,258 INFO L87 Difference]: Start difference. First operand 847 states and 1258 transitions. Second operand 4 states. [2018-12-03 04:53:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:27,409 INFO L93 Difference]: Finished difference Result 1813 states and 2661 transitions. [2018-12-03 04:53:27,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:27,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-03 04:53:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:27,411 INFO L225 Difference]: With dead ends: 1813 [2018-12-03 04:53:27,412 INFO L226 Difference]: Without dead ends: 979 [2018-12-03 04:53:27,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-12-03 04:53:27,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2018-12-03 04:53:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 04:53:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1253 transitions. [2018-12-03 04:53:27,431 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1253 transitions. Word has length 121 [2018-12-03 04:53:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:27,431 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1253 transitions. [2018-12-03 04:53:27,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1253 transitions. [2018-12-03 04:53:27,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 04:53:27,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:27,432 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:27,432 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:27,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1832311600, now seen corresponding path program 1 times [2018-12-03 04:53:27,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:27,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:27,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:27,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:27,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:27,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:27,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:27,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:27,483 INFO L87 Difference]: Start difference. First operand 847 states and 1253 transitions. Second operand 4 states. [2018-12-03 04:53:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:27,661 INFO L93 Difference]: Finished difference Result 1813 states and 2651 transitions. [2018-12-03 04:53:27,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:27,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-03 04:53:27,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:27,663 INFO L225 Difference]: With dead ends: 1813 [2018-12-03 04:53:27,663 INFO L226 Difference]: Without dead ends: 979 [2018-12-03 04:53:27,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-12-03 04:53:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 847. [2018-12-03 04:53:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-12-03 04:53:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1248 transitions. [2018-12-03 04:53:27,676 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1248 transitions. Word has length 121 [2018-12-03 04:53:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:27,676 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 1248 transitions. [2018-12-03 04:53:27,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1248 transitions. [2018-12-03 04:53:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 04:53:27,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:27,677 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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] [2018-12-03 04:53:27,677 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1213590989, now seen corresponding path program 1 times [2018-12-03 04:53:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:27,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-03 04:53:27,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:27,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:27,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:27,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:27,713 INFO L87 Difference]: Start difference. First operand 847 states and 1248 transitions. Second operand 4 states. [2018-12-03 04:53:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:27,880 INFO L93 Difference]: Finished difference Result 1644 states and 2431 transitions. [2018-12-03 04:53:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:27,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-03 04:53:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:27,883 INFO L225 Difference]: With dead ends: 1644 [2018-12-03 04:53:27,883 INFO L226 Difference]: Without dead ends: 985 [2018-12-03 04:53:27,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2018-12-03 04:53:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 919. [2018-12-03 04:53:27,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-03 04:53:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1368 transitions. [2018-12-03 04:53:27,898 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1368 transitions. Word has length 121 [2018-12-03 04:53:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1368 transitions. [2018-12-03 04:53:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1368 transitions. [2018-12-03 04:53:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 04:53:27,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:27,900 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:27,900 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:27,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1233245309, now seen corresponding path program 1 times [2018-12-03 04:53:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:27,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:27,950 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:27,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:27,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:27,951 INFO L87 Difference]: Start difference. First operand 919 states and 1368 transitions. Second operand 4 states. [2018-12-03 04:53:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:28,125 INFO L93 Difference]: Finished difference Result 1957 states and 2881 transitions. [2018-12-03 04:53:28,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:28,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-03 04:53:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:28,127 INFO L225 Difference]: With dead ends: 1957 [2018-12-03 04:53:28,127 INFO L226 Difference]: Without dead ends: 1051 [2018-12-03 04:53:28,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-12-03 04:53:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2018-12-03 04:53:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-03 04:53:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1363 transitions. [2018-12-03 04:53:28,140 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1363 transitions. Word has length 122 [2018-12-03 04:53:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:28,140 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1363 transitions. [2018-12-03 04:53:28,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1363 transitions. [2018-12-03 04:53:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 04:53:28,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:28,141 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:28,141 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:28,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:28,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2124457781, now seen corresponding path program 1 times [2018-12-03 04:53:28,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:28,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:28,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:28,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:28,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:28,187 INFO L87 Difference]: Start difference. First operand 919 states and 1363 transitions. Second operand 4 states. [2018-12-03 04:53:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:28,349 INFO L93 Difference]: Finished difference Result 1957 states and 2871 transitions. [2018-12-03 04:53:28,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:28,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-03 04:53:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:28,351 INFO L225 Difference]: With dead ends: 1957 [2018-12-03 04:53:28,351 INFO L226 Difference]: Without dead ends: 1051 [2018-12-03 04:53:28,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:28,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2018-12-03 04:53:28,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 919. [2018-12-03 04:53:28,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-03 04:53:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1358 transitions. [2018-12-03 04:53:28,365 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1358 transitions. Word has length 123 [2018-12-03 04:53:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:28,365 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1358 transitions. [2018-12-03 04:53:28,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:28,365 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1358 transitions. [2018-12-03 04:53:28,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:53:28,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:28,366 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:28,366 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:28,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash 805588424, now seen corresponding path program 1 times [2018-12-03 04:53:28,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:28,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-03 04:53:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:28,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:28,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:28,409 INFO L87 Difference]: Start difference. First operand 919 states and 1358 transitions. Second operand 4 states. [2018-12-03 04:53:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:28,563 INFO L93 Difference]: Finished difference Result 1912 states and 2806 transitions. [2018-12-03 04:53:28,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:28,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-03 04:53:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:28,565 INFO L225 Difference]: With dead ends: 1912 [2018-12-03 04:53:28,565 INFO L226 Difference]: Without dead ends: 1006 [2018-12-03 04:53:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-12-03 04:53:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 919. [2018-12-03 04:53:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2018-12-03 04:53:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2018-12-03 04:53:28,579 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 124 [2018-12-03 04:53:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:28,580 INFO L480 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2018-12-03 04:53:28,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2018-12-03 04:53:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:53:28,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:28,581 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2018-12-03 04:53:28,581 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:28,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1158112039, now seen corresponding path program 1 times [2018-12-03 04:53:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-03 04:53:28,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:28,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 04:53:28,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:28,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 04:53:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 04:53:28,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 04:53:28,618 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 4 states. [2018-12-03 04:53:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:28,795 INFO L93 Difference]: Finished difference Result 2057 states and 3036 transitions. [2018-12-03 04:53:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 04:53:28,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-03 04:53:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:28,797 INFO L225 Difference]: With dead ends: 2057 [2018-12-03 04:53:28,797 INFO L226 Difference]: Without dead ends: 1151 [2018-12-03 04:53:28,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:53:28,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-12-03 04:53:28,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1029. [2018-12-03 04:53:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-12-03 04:53:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1543 transitions. [2018-12-03 04:53:28,823 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1543 transitions. Word has length 124 [2018-12-03 04:53:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1543 transitions. [2018-12-03 04:53:28,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 04:53:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1543 transitions. [2018-12-03 04:53:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 04:53:28,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:28,825 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:28,825 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:28,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:28,825 INFO L82 PathProgramCache]: Analyzing trace with hash -421436053, now seen corresponding path program 1 times [2018-12-03 04:53:28,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:28,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-03 04:53:28,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:28,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:53:28,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:28,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:53:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:53:28,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:53:28,902 INFO L87 Difference]: Start difference. First operand 1029 states and 1543 transitions. Second operand 6 states. [2018-12-03 04:53:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:29,162 INFO L93 Difference]: Finished difference Result 1934 states and 2904 transitions. [2018-12-03 04:53:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:53:29,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-12-03 04:53:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:29,164 INFO L225 Difference]: With dead ends: 1934 [2018-12-03 04:53:29,164 INFO L226 Difference]: Without dead ends: 1113 [2018-12-03 04:53:29,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:53:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-12-03 04:53:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1037. [2018-12-03 04:53:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-12-03 04:53:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1556 transitions. [2018-12-03 04:53:29,180 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1556 transitions. Word has length 128 [2018-12-03 04:53:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:29,180 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1556 transitions. [2018-12-03 04:53:29,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:53:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1556 transitions. [2018-12-03 04:53:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 04:53:29,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:29,181 INFO L402 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-12-03 04:53:29,181 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:29,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:29,181 INFO L82 PathProgramCache]: Analyzing trace with hash -527506, now seen corresponding path program 1 times [2018-12-03 04:53:29,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:29,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:29,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:29,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:53:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-12-03 04:53:29,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:53:29,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:53:29,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:53:29,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:53:29,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:53:29,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:53:29,251 INFO L87 Difference]: Start difference. First operand 1037 states and 1556 transitions. Second operand 6 states. [2018-12-03 04:53:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:53:29,505 INFO L93 Difference]: Finished difference Result 1931 states and 2900 transitions. [2018-12-03 04:53:29,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:53:29,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-12-03 04:53:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:53:29,507 INFO L225 Difference]: With dead ends: 1931 [2018-12-03 04:53:29,507 INFO L226 Difference]: Without dead ends: 1110 [2018-12-03 04:53:29,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 04:53:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2018-12-03 04:53:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1038. [2018-12-03 04:53:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1038 states. [2018-12-03 04:53:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1557 transitions. [2018-12-03 04:53:29,524 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1557 transitions. Word has length 129 [2018-12-03 04:53:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:53:29,525 INFO L480 AbstractCegarLoop]: Abstraction has 1038 states and 1557 transitions. [2018-12-03 04:53:29,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:53:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1557 transitions. [2018-12-03 04:53:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 04:53:29,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:53:29,526 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:53:29,526 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:53:29,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:53:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-12-03 04:53:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:53:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:53:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:53:29,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:53:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:53:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 04:53:29,736 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 04:53:29,770 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20492 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 04:53:29,771 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-03 04:53:29,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:53:29 BoogieIcfgContainer [2018-12-03 04:53:29,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:53:29,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:53:29,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:53:29,807 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:53:29,808 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:53:20" (3/4) ... [2018-12-03 04:53:29,811 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-03 04:53:29,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:53:29,812 INFO L168 Benchmark]: Toolchain (without parser) took 10051.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.7 MB). Free memory was 956.0 MB in the beginning and 967.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 371.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:29,813 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:53:29,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:29,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:53:29,814 INFO L168 Benchmark]: Boogie Preprocessor took 42.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:29,814 INFO L168 Benchmark]: RCFGBuilder took 608.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:29,814 INFO L168 Benchmark]: TraceAbstraction took 9027.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.0 GB in the beginning and 967.7 MB in the end (delta: 62.2 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:29,815 INFO L168 Benchmark]: Witness Printer took 3.98 ms. Allocated memory is still 1.4 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:53:29,817 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 608.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.0 MB). Peak memory consumption was 86.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9027.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 241.7 MB). Free memory was 1.0 GB in the beginning and 967.7 MB in the end (delta: 62.2 MB). Peak memory consumption was 303.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.98 ms. Allocated memory is still 1.4 GB. Free memory is still 967.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20492 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20541, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20494:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20501:0}, SSLv3_client_data={20494:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=12292, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->version=0, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->init_buf={-1:2}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=12292, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20511:20517}, init=1, ret=-1, s={20501:0}, s={20501:0}, s->state=4368, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4368, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4384, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->hit=0, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4384, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->state=4400, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20537, (s->s3)->tmp.new_cipher={20502:0}, blastFlag=2, buf={20511:20517}, init=1, ret=1, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4400, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20511:20517}, init=1, ret=5, s={20501:0}, s={20501:0}, s->state=4416, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4416, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=6, s={20501:0}, s={20501:0}, s->state=4432, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20542, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->s3={20506:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4432, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=7, s={20501:0}, s={20501:0}, s->state=4448, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=0, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1646] __VERIFIER_error() VAL [={1:0}, blastFlag=4, buf={20511:20517}, init=1, ret=0, s={20501:0}, s={20501:0}, skip=0, SSLv3_client_data={20494:0}, state=4448, tmp=0, tmp___0={20501:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 8.9s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7485 SDtfs, 3047 SDslu, 9993 SDs, 0 SdLazy, 5723 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 70 SyntacticMatches, 46 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 2754 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3213 NumberOfCodeBlocks, 3213 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 683183 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 2861/2861 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 04:53:31,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:53:31,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:53:31,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:53:31,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:53:31,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:53:31,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:53:31,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:53:31,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:53:31,082 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:53:31,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:53:31,083 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:53:31,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:53:31,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:53:31,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:53:31,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:53:31,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:53:31,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:53:31,088 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:53:31,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:53:31,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:53:31,091 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:53:31,093 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:53:31,093 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:53:31,093 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:53:31,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:53:31,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:53:31,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:53:31,095 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:53:31,096 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:53:31,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:53:31,097 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:53:31,097 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:53:31,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:53:31,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:53:31,098 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:53:31,098 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 04:53:31,108 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:53:31,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:53:31,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:53:31,109 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:53:31,109 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:53:31,110 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:53:31,110 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:53:31,110 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:53:31,110 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:53:31,110 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:53:31,110 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 04:53:31,111 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:53:31,112 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:53:31,112 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:53:31,112 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 04:53:31,113 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 04:53:31,113 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_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9b2fdeede7b1203b845c20c562beaee69c29ce3b [2018-12-03 04:53:31,136 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:53:31,146 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:53:31,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:53:31,150 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:53:31,150 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:53:31,151 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-03 04:53:31,194 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/91d381574/9d93f8e14d4a42098a1b4aefc6c6476c/FLAGaca6c4cef [2018-12-03 04:53:31,619 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:53:31,620 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/sv-benchmarks/c/ssh/s3_clnt.blast.01_false-unreach-call.i.cil.c [2018-12-03 04:53:31,628 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/91d381574/9d93f8e14d4a42098a1b4aefc6c6476c/FLAGaca6c4cef [2018-12-03 04:53:31,637 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a226608d-6097-41ed-ade6-cb61a595d544/bin-2019/utaipan/data/91d381574/9d93f8e14d4a42098a1b4aefc6c6476c [2018-12-03 04:53:31,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:53:31,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:53:31,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:53:31,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:53:31,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:53:31,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:53:31" (1/1) ... [2018-12-03 04:53:31,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4fc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:53:31, skipping insertion in model container [2018-12-03 04:53:31,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:53:31" (1/1) ... [2018-12-03 04:53:31,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:53:31,683 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:53:31,924 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:53:31,988 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:53:32,060 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:53:32,061 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 04:53:32,064 INFO L168 Benchmark]: Toolchain (without parser) took 425.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:32,065 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:53:32,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-03 04:53:32,067 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...