./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-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_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/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 07be4c432baffc0b0315a344289242773ed6234f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/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 07be4c432baffc0b0315a344289242773ed6234f .......................................................................................................................................................................... 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-02 03:08:16,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:08:16,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:08:16,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:08:16,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:08:16,320 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:08:16,321 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:08:16,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:08:16,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:08:16,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:08:16,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:08:16,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:08:16,326 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:08:16,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:08:16,327 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:08:16,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:08:16,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:08:16,329 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:08:16,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:08:16,332 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:08:16,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:08:16,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:08:16,335 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:08:16,335 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:08:16,335 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:08:16,336 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:08:16,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:08:16,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:08:16,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:08:16,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:08:16,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:08:16,338 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:08:16,338 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:08:16,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:08:16,339 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:08:16,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:08:16,340 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 03:08:16,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:08:16,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:08:16,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:08:16,348 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:08:16,348 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:08:16,349 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:08:16,349 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:08:16,349 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 03:08:16,349 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:08:16,349 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:08:16,349 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 03:08:16,350 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 03:08:16,350 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:08:16,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:08:16,350 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:08:16,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:08:16,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:08:16,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:08:16,352 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:08:16,352 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:08:16,352 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:08:16,352 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:08:16,353 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:08:16,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 03:08:16,354 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 03:08:16,354 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_e8b359ac-a588-422d-8d72-c3bdf608e61a/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 -> 07be4c432baffc0b0315a344289242773ed6234f [2018-12-02 03:08:16,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:08:16,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:08:16,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:08:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:08:16,387 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:08:16,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-02 03:08:16,426 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/8388a876c/8cf4cb632caa4065b29217cb15b653ee/FLAG1dbb52bef [2018-12-02 03:08:16,855 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:08:16,856 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-02 03:08:16,865 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/8388a876c/8cf4cb632caa4065b29217cb15b653ee/FLAG1dbb52bef [2018-12-02 03:08:16,873 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/8388a876c/8cf4cb632caa4065b29217cb15b653ee [2018-12-02 03:08:16,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:08:16,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:08:16,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:08:16,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:08:16,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:08:16,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:16" (1/1) ... [2018-12-02 03:08:16,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca4a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:16, skipping insertion in model container [2018-12-02 03:08:16,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:16" (1/1) ... [2018-12-02 03:08:16,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:08:16,918 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:08:17,170 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:17,178 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:08:17,230 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:17,241 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:08:17,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17 WrapperNode [2018-12-02 03:08:17,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:08:17,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:08:17,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:08:17,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:08:17,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:08:17,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:08:17,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:08:17,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:08:17,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... [2018-12-02 03:08:17,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:08:17,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:08:17,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:08:17,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:08:17,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/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-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 03:08:17,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 03:08:17,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 03:08:17,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 03:08:17,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 03:08:17,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 03:08:17,351 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-02 03:08:17,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-02 03:08:17,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:08:17,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:08:17,541 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 03:08:17,542 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 03:08:17,911 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:08:17,911 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 03:08:17,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:17 BoogieIcfgContainer [2018-12-02 03:08:17,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:08:17,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 03:08:17,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 03:08:17,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 03:08:17,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:08:16" (1/3) ... [2018-12-02 03:08:17,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b035c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:08:17, skipping insertion in model container [2018-12-02 03:08:17,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:17" (2/3) ... [2018-12-02 03:08:17,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b035c27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:08:17, skipping insertion in model container [2018-12-02 03:08:17,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:17" (3/3) ... [2018-12-02 03:08:17,916 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-02 03:08:17,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 03:08:17,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 03:08:17,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 03:08:17,956 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 03:08:17,956 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 03:08:17,956 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 03:08:17,956 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:08:17,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:08:17,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 03:08:17,957 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:08:17,957 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 03:08:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-02 03:08:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 03:08:17,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:17,974 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-02 03:08:17,975 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:17,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1641138201, now seen corresponding path program 1 times [2018-12-02 03:08:17,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:18,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:18,133 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-02 03:08:18,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:18,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:18,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:18,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:18,148 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-02 03:08:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:18,220 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-12-02 03:08:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:18,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 03:08:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:18,230 INFO L225 Difference]: With dead ends: 385 [2018-12-02 03:08:18,231 INFO L226 Difference]: Without dead ends: 223 [2018-12-02 03:08:18,233 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-02 03:08:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-02 03:08:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-02 03:08:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-02 03:08:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-12-02 03:08:18,265 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-12-02 03:08:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:18,266 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-12-02 03:08:18,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-12-02 03:08:18,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 03:08:18,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:18,267 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-02 03:08:18,267 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:18,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:18,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1873554158, now seen corresponding path program 1 times [2018-12-02 03:08:18,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:18,345 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-02 03:08:18,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:18,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:18,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:18,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:18,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:18,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:18,347 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-12-02 03:08:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:18,390 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-12-02 03:08:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:18,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-02 03:08:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:18,393 INFO L225 Difference]: With dead ends: 432 [2018-12-02 03:08:18,393 INFO L226 Difference]: Without dead ends: 325 [2018-12-02 03:08:18,394 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-02 03:08:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-02 03:08:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-12-02 03:08:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-02 03:08:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-12-02 03:08:18,411 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-12-02 03:08:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:18,411 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-12-02 03:08:18,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-12-02 03:08:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:08:18,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:18,414 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-02 03:08:18,414 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:18,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1280906889, now seen corresponding path program 1 times [2018-12-02 03:08:18,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:18,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:18,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:18,500 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-02 03:08:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:18,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:18,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:18,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:18,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:18,502 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-12-02 03:08:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:18,806 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-12-02 03:08:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:18,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 03:08:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:18,808 INFO L225 Difference]: With dead ends: 825 [2018-12-02 03:08:18,808 INFO L226 Difference]: Without dead ends: 513 [2018-12-02 03:08:18,809 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-02 03:08:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-02 03:08:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-12-02 03:08:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-02 03:08:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-12-02 03:08:18,821 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-12-02 03:08:18,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:18,821 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-12-02 03:08:18,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-12-02 03:08:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 03:08:18,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:18,824 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-02 03:08:18,824 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:18,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1146893383, now seen corresponding path program 1 times [2018-12-02 03:08:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:18,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:18,887 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-02 03:08:18,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:18,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:18,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:18,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:18,888 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-12-02 03:08:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:19,106 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-12-02 03:08:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:19,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 03:08:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:19,108 INFO L225 Difference]: With dead ends: 821 [2018-12-02 03:08:19,108 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 03:08:19,109 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-02 03:08:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 03:08:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-12-02 03:08:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-02 03:08:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-12-02 03:08:19,122 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-12-02 03:08:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:19,123 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-12-02 03:08:19,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-12-02 03:08:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 03:08:19,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:19,125 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-02 03:08:19,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:19,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1048989966, now seen corresponding path program 1 times [2018-12-02 03:08:19,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:19,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:19,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:19,184 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-02 03:08:19,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:19,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:19,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:19,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:19,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:19,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:19,185 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-12-02 03:08:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:19,413 INFO L93 Difference]: Finished difference Result 947 states and 1428 transitions. [2018-12-02 03:08:19,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:19,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 03:08:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:19,416 INFO L225 Difference]: With dead ends: 947 [2018-12-02 03:08:19,416 INFO L226 Difference]: Without dead ends: 545 [2018-12-02 03:08:19,417 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-02 03:08:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-12-02 03:08:19,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 417. [2018-12-02 03:08:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-12-02 03:08:19,429 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-12-02 03:08:19,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:19,430 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-12-02 03:08:19,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-12-02 03:08:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:19,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:19,431 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-02 03:08:19,431 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:19,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1142804125, now seen corresponding path program 1 times [2018-12-02 03:08:19,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:19,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:19,487 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-02 03:08:19,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:19,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:19,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:19,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:19,488 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-12-02 03:08:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:19,729 INFO L93 Difference]: Finished difference Result 947 states and 1426 transitions. [2018-12-02 03:08:19,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:19,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:19,731 INFO L225 Difference]: With dead ends: 947 [2018-12-02 03:08:19,731 INFO L226 Difference]: Without dead ends: 543 [2018-12-02 03:08:19,732 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-02 03:08:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-02 03:08:19,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-02 03:08:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 630 transitions. [2018-12-02 03:08:19,739 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 630 transitions. Word has length 78 [2018-12-02 03:08:19,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:19,739 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 630 transitions. [2018-12-02 03:08:19,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 630 transitions. [2018-12-02 03:08:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:19,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:19,740 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-02 03:08:19,741 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:19,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:19,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1161459583, now seen corresponding path program 1 times [2018-12-02 03:08:19,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:19,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:19,776 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-02 03:08:19,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:19,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:19,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:19,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:19,777 INFO L87 Difference]: Start difference. First operand 417 states and 630 transitions. Second operand 4 states. [2018-12-02 03:08:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:19,994 INFO L93 Difference]: Finished difference Result 947 states and 1422 transitions. [2018-12-02 03:08:19,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:19,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:19,996 INFO L225 Difference]: With dead ends: 947 [2018-12-02 03:08:19,996 INFO L226 Difference]: Without dead ends: 543 [2018-12-02 03:08:19,997 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-02 03:08:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-02 03:08:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-02 03:08:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2018-12-02 03:08:20,005 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 78 [2018-12-02 03:08:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:20,005 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2018-12-02 03:08:20,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2018-12-02 03:08:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:20,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:20,006 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-02 03:08:20,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1866960220, now seen corresponding path program 1 times [2018-12-02 03:08:20,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:20,049 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-02 03:08:20,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:20,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:20,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:20,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:20,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:20,050 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2018-12-02 03:08:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:20,266 INFO L93 Difference]: Finished difference Result 800 states and 1194 transitions. [2018-12-02 03:08:20,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:20,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:20,268 INFO L225 Difference]: With dead ends: 800 [2018-12-02 03:08:20,268 INFO L226 Difference]: Without dead ends: 543 [2018-12-02 03:08:20,269 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-02 03:08:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-02 03:08:20,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-02 03:08:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2018-12-02 03:08:20,281 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 78 [2018-12-02 03:08:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:20,281 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2018-12-02 03:08:20,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2018-12-02 03:08:20,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:20,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:20,282 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-02 03:08:20,282 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:20,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:20,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1306796005, now seen corresponding path program 1 times [2018-12-02 03:08:20,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:20,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:20,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:20,328 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-02 03:08:20,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:20,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:20,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:20,329 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand 4 states. [2018-12-02 03:08:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:20,496 INFO L93 Difference]: Finished difference Result 863 states and 1288 transitions. [2018-12-02 03:08:20,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:20,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:20,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:20,497 INFO L225 Difference]: With dead ends: 863 [2018-12-02 03:08:20,497 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 03:08:20,498 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-02 03:08:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 03:08:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-02 03:08:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 624 transitions. [2018-12-02 03:08:20,505 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 624 transitions. Word has length 78 [2018-12-02 03:08:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:20,505 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 624 transitions. [2018-12-02 03:08:20,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 624 transitions. [2018-12-02 03:08:20,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:20,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:20,506 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-02 03:08:20,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:20,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1288140547, now seen corresponding path program 1 times [2018-12-02 03:08:20,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:20,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:20,543 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-02 03:08:20,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:20,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:20,543 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:20,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:20,544 INFO L87 Difference]: Start difference. First operand 417 states and 624 transitions. Second operand 4 states. [2018-12-02 03:08:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:20,703 INFO L93 Difference]: Finished difference Result 863 states and 1284 transitions. [2018-12-02 03:08:20,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:20,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:20,705 INFO L225 Difference]: With dead ends: 863 [2018-12-02 03:08:20,705 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 03:08:20,705 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-02 03:08:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 03:08:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-02 03:08:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2018-12-02 03:08:20,712 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 78 [2018-12-02 03:08:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:20,713 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2018-12-02 03:08:20,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2018-12-02 03:08:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 03:08:20,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:20,714 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-02 03:08:20,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:20,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:20,714 INFO L82 PathProgramCache]: Analyzing trace with hash 582639910, now seen corresponding path program 1 times [2018-12-02 03:08:20,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:20,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:20,746 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-02 03:08:20,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:20,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:20,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:20,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:20,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:20,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:20,747 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2018-12-02 03:08:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:20,906 INFO L93 Difference]: Finished difference Result 716 states and 1059 transitions. [2018-12-02 03:08:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:20,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 03:08:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:20,908 INFO L225 Difference]: With dead ends: 716 [2018-12-02 03:08:20,908 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 03:08:20,909 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-02 03:08:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 03:08:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-02 03:08:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2018-12-02 03:08:20,919 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 78 [2018-12-02 03:08:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:20,919 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2018-12-02 03:08:20,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2018-12-02 03:08:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 03:08:20,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:20,921 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-02 03:08:20,921 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:20,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1171941476, now seen corresponding path program 1 times [2018-12-02 03:08:20,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:20,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:20,965 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-02 03:08:20,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:20,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:20,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:20,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:20,966 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2018-12-02 03:08:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:21,258 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2018-12-02 03:08:21,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:21,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 03:08:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:21,260 INFO L225 Difference]: With dead ends: 947 [2018-12-02 03:08:21,260 INFO L226 Difference]: Without dead ends: 543 [2018-12-02 03:08:21,261 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-02 03:08:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-02 03:08:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-02 03:08:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 618 transitions. [2018-12-02 03:08:21,271 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 618 transitions. Word has length 79 [2018-12-02 03:08:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:21,271 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 618 transitions. [2018-12-02 03:08:21,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2018-12-02 03:08:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 03:08:21,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:21,272 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-02 03:08:21,272 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:21,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:21,272 INFO L82 PathProgramCache]: Analyzing trace with hash 884067071, now seen corresponding path program 1 times [2018-12-02 03:08:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:21,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:21,329 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-02 03:08:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:21,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:21,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:21,330 INFO L87 Difference]: Start difference. First operand 417 states and 618 transitions. Second operand 4 states. [2018-12-02 03:08:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:21,579 INFO L93 Difference]: Finished difference Result 794 states and 1172 transitions. [2018-12-02 03:08:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:21,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 03:08:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:21,581 INFO L225 Difference]: With dead ends: 794 [2018-12-02 03:08:21,581 INFO L226 Difference]: Without dead ends: 537 [2018-12-02 03:08:21,581 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-02 03:08:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-02 03:08:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2018-12-02 03:08:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 616 transitions. [2018-12-02 03:08:21,589 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 616 transitions. Word has length 79 [2018-12-02 03:08:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:21,589 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 616 transitions. [2018-12-02 03:08:21,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 616 transitions. [2018-12-02 03:08:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 03:08:21,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:21,590 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-02 03:08:21,590 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:21,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1751218522, now seen corresponding path program 1 times [2018-12-02 03:08:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:21,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:21,623 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-02 03:08:21,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:21,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:21,623 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:21,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:21,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:21,624 INFO L87 Difference]: Start difference. First operand 417 states and 616 transitions. Second operand 4 states. [2018-12-02 03:08:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:21,788 INFO L93 Difference]: Finished difference Result 863 states and 1268 transitions. [2018-12-02 03:08:21,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:21,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 03:08:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:21,789 INFO L225 Difference]: With dead ends: 863 [2018-12-02 03:08:21,789 INFO L226 Difference]: Without dead ends: 459 [2018-12-02 03:08:21,789 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-02 03:08:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-02 03:08:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-02 03:08:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 614 transitions. [2018-12-02 03:08:21,797 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 614 transitions. Word has length 79 [2018-12-02 03:08:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 614 transitions. [2018-12-02 03:08:21,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 614 transitions. [2018-12-02 03:08:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 03:08:21,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:21,798 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-02 03:08:21,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:21,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash -487740227, now seen corresponding path program 1 times [2018-12-02 03:08:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:21,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:21,840 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-02 03:08:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:21,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:21,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:21,841 INFO L87 Difference]: Start difference. First operand 417 states and 614 transitions. Second operand 4 states. [2018-12-02 03:08:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:22,018 INFO L93 Difference]: Finished difference Result 710 states and 1040 transitions. [2018-12-02 03:08:22,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:22,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 03:08:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:22,019 INFO L225 Difference]: With dead ends: 710 [2018-12-02 03:08:22,019 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 03:08:22,020 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-02 03:08:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 03:08:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2018-12-02 03:08:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 612 transitions. [2018-12-02 03:08:22,027 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 612 transitions. Word has length 79 [2018-12-02 03:08:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:22,027 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 612 transitions. [2018-12-02 03:08:22,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 612 transitions. [2018-12-02 03:08:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 03:08:22,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:22,028 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-02 03:08:22,028 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:22,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,028 INFO L82 PathProgramCache]: Analyzing trace with hash 257119526, now seen corresponding path program 1 times [2018-12-02 03:08:22,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:22,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:22,062 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-02 03:08:22,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:22,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:22,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:22,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:22,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:22,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:22,063 INFO L87 Difference]: Start difference. First operand 417 states and 612 transitions. Second operand 4 states. [2018-12-02 03:08:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:22,318 INFO L93 Difference]: Finished difference Result 941 states and 1379 transitions. [2018-12-02 03:08:22,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:22,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 03:08:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:22,320 INFO L225 Difference]: With dead ends: 941 [2018-12-02 03:08:22,320 INFO L226 Difference]: Without dead ends: 537 [2018-12-02 03:08:22,321 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-02 03:08:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-02 03:08:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2018-12-02 03:08:22,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2018-12-02 03:08:22,329 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 80 [2018-12-02 03:08:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:22,329 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2018-12-02 03:08:22,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2018-12-02 03:08:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 03:08:22,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:22,330 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-02 03:08:22,330 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:22,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 680766248, now seen corresponding path program 1 times [2018-12-02 03:08:22,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:22,362 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-02 03:08:22,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:22,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:22,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:22,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:22,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:22,362 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand 4 states. [2018-12-02 03:08:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:22,498 INFO L93 Difference]: Finished difference Result 857 states and 1249 transitions. [2018-12-02 03:08:22,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:22,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 03:08:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:22,499 INFO L225 Difference]: With dead ends: 857 [2018-12-02 03:08:22,499 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 03:08:22,500 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-02 03:08:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 03:08:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2018-12-02 03:08:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 608 transitions. [2018-12-02 03:08:22,506 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 608 transitions. Word has length 80 [2018-12-02 03:08:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:22,506 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 608 transitions. [2018-12-02 03:08:22,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 608 transitions. [2018-12-02 03:08:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 03:08:22,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:22,507 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-02 03:08:22,507 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:22,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,507 INFO L82 PathProgramCache]: Analyzing trace with hash -932629983, now seen corresponding path program 1 times [2018-12-02 03:08:22,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:22,554 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-02 03:08:22,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:22,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:22,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:22,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:22,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:22,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:22,555 INFO L87 Difference]: Start difference. First operand 417 states and 608 transitions. Second operand 4 states. [2018-12-02 03:08:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:22,772 INFO L93 Difference]: Finished difference Result 923 states and 1349 transitions. [2018-12-02 03:08:22,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:22,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 03:08:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:22,774 INFO L225 Difference]: With dead ends: 923 [2018-12-02 03:08:22,774 INFO L226 Difference]: Without dead ends: 519 [2018-12-02 03:08:22,774 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-02 03:08:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-02 03:08:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2018-12-02 03:08:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 606 transitions. [2018-12-02 03:08:22,781 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 606 transitions. Word has length 81 [2018-12-02 03:08:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:22,781 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 606 transitions. [2018-12-02 03:08:22,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 606 transitions. [2018-12-02 03:08:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 03:08:22,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:22,782 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-02 03:08:22,782 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:22,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1670910322, now seen corresponding path program 1 times [2018-12-02 03:08:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:22,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:22,810 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-02 03:08:22,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:22,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:22,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:22,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:22,811 INFO L87 Difference]: Start difference. First operand 417 states and 606 transitions. Second operand 4 states. [2018-12-02 03:08:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,045 INFO L93 Difference]: Finished difference Result 923 states and 1345 transitions. [2018-12-02 03:08:23,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:23,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 03:08:23,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,046 INFO L225 Difference]: With dead ends: 923 [2018-12-02 03:08:23,046 INFO L226 Difference]: Without dead ends: 519 [2018-12-02 03:08:23,047 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-02 03:08:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-02 03:08:23,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2018-12-02 03:08:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 604 transitions. [2018-12-02 03:08:23,058 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 604 transitions. Word has length 81 [2018-12-02 03:08:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,058 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 604 transitions. [2018-12-02 03:08:23,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 604 transitions. [2018-12-02 03:08:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 03:08:23,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,060 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-02 03:08:23,060 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash -684483489, now seen corresponding path program 1 times [2018-12-02 03:08:23,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,102 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-02 03:08:23,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:23,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:23,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:23,103 INFO L87 Difference]: Start difference. First operand 417 states and 604 transitions. Second operand 4 states. [2018-12-02 03:08:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,244 INFO L93 Difference]: Finished difference Result 839 states and 1215 transitions. [2018-12-02 03:08:23,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:23,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 03:08:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,245 INFO L225 Difference]: With dead ends: 839 [2018-12-02 03:08:23,245 INFO L226 Difference]: Without dead ends: 435 [2018-12-02 03:08:23,245 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-02 03:08:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-02 03:08:23,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 417. [2018-12-02 03:08:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 03:08:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 602 transitions. [2018-12-02 03:08:23,256 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 602 transitions. Word has length 81 [2018-12-02 03:08:23,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,256 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 602 transitions. [2018-12-02 03:08:23,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:23,257 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 602 transitions. [2018-12-02 03:08:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 03:08:23,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,258 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-02 03:08:23,258 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1919056816, now seen corresponding path program 1 times [2018-12-02 03:08:23,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,288 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-02 03:08:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:23,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:23,289 INFO L87 Difference]: Start difference. First operand 417 states and 602 transitions. Second operand 3 states. [2018-12-02 03:08:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,314 INFO L93 Difference]: Finished difference Result 823 states and 1196 transitions. [2018-12-02 03:08:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:23,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-02 03:08:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,315 INFO L225 Difference]: With dead ends: 823 [2018-12-02 03:08:23,315 INFO L226 Difference]: Without dead ends: 568 [2018-12-02 03:08:23,316 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-02 03:08:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-02 03:08:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2018-12-02 03:08:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-02 03:08:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 821 transitions. [2018-12-02 03:08:23,323 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 821 transitions. Word has length 81 [2018-12-02 03:08:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,324 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 821 transitions. [2018-12-02 03:08:23,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 821 transitions. [2018-12-02 03:08:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 03:08:23,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,324 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-02 03:08:23,325 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash -318802554, now seen corresponding path program 1 times [2018-12-02 03:08:23,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,352 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-02 03:08:23,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:23,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:23,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:23,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:23,353 INFO L87 Difference]: Start difference. First operand 568 states and 821 transitions. Second operand 3 states. [2018-12-02 03:08:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,380 INFO L93 Difference]: Finished difference Result 1125 states and 1634 transitions. [2018-12-02 03:08:23,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:23,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-02 03:08:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,383 INFO L225 Difference]: With dead ends: 1125 [2018-12-02 03:08:23,383 INFO L226 Difference]: Without dead ends: 719 [2018-12-02 03:08:23,384 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-02 03:08:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-12-02 03:08:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-12-02 03:08:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-02 03:08:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1041 transitions. [2018-12-02 03:08:23,398 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1041 transitions. Word has length 83 [2018-12-02 03:08:23,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,399 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1041 transitions. [2018-12-02 03:08:23,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1041 transitions. [2018-12-02 03:08:23,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 03:08:23,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,400 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-02 03:08:23,400 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1417041014, now seen corresponding path program 1 times [2018-12-02 03:08:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,435 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-02 03:08:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:08:23,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 03:08:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:08:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:08:23,436 INFO L87 Difference]: Start difference. First operand 719 states and 1041 transitions. Second operand 3 states. [2018-12-02 03:08:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,472 INFO L93 Difference]: Finished difference Result 872 states and 1264 transitions. [2018-12-02 03:08:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:08:23,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-02 03:08:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,474 INFO L225 Difference]: With dead ends: 872 [2018-12-02 03:08:23,474 INFO L226 Difference]: Without dead ends: 870 [2018-12-02 03:08:23,474 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-02 03:08:23,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-12-02 03:08:23,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2018-12-02 03:08:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-12-02 03:08:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1262 transitions. [2018-12-02 03:08:23,485 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1262 transitions. Word has length 104 [2018-12-02 03:08:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,485 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1262 transitions. [2018-12-02 03:08:23,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 03:08:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1262 transitions. [2018-12-02 03:08:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 03:08:23,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,486 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, 1, 1] [2018-12-02 03:08:23,486 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1855841249, now seen corresponding path program 1 times [2018-12-02 03:08:23,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-02 03:08:23,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:23,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:23,534 INFO L87 Difference]: Start difference. First operand 870 states and 1262 transitions. Second operand 4 states. [2018-12-02 03:08:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,759 INFO L93 Difference]: Finished difference Result 2038 states and 2970 transitions. [2018-12-02 03:08:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:23,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-02 03:08:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,762 INFO L225 Difference]: With dead ends: 2038 [2018-12-02 03:08:23,762 INFO L226 Difference]: Without dead ends: 1181 [2018-12-02 03:08:23,763 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-02 03:08:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-12-02 03:08:23,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1014. [2018-12-02 03:08:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-02 03:08:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1514 transitions. [2018-12-02 03:08:23,793 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1514 transitions. Word has length 130 [2018-12-02 03:08:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:23,793 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1514 transitions. [2018-12-02 03:08:23,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1514 transitions. [2018-12-02 03:08:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 03:08:23,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:23,794 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, 1, 1] [2018-12-02 03:08:23,794 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:23,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash -430109825, now seen corresponding path program 1 times [2018-12-02 03:08:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:23,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:23,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:23,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:23,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:23,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:23,835 INFO L87 Difference]: Start difference. First operand 1014 states and 1514 transitions. Second operand 4 states. [2018-12-02 03:08:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:23,989 INFO L93 Difference]: Finished difference Result 2176 states and 3210 transitions. [2018-12-02 03:08:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:23,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 03:08:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:23,992 INFO L225 Difference]: With dead ends: 2176 [2018-12-02 03:08:23,992 INFO L226 Difference]: Without dead ends: 1175 [2018-12-02 03:08:23,992 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-02 03:08:23,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-12-02 03:08:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2018-12-02 03:08:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-02 03:08:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1508 transitions. [2018-12-02 03:08:24,005 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1508 transitions. Word has length 145 [2018-12-02 03:08:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,005 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1508 transitions. [2018-12-02 03:08:24,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1508 transitions. [2018-12-02 03:08:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 03:08:24,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,006 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 1] [2018-12-02 03:08:24,006 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2085512931, now seen corresponding path program 1 times [2018-12-02 03:08:24,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:24,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:24,045 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:24,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:24,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:24,045 INFO L87 Difference]: Start difference. First operand 1014 states and 1508 transitions. Second operand 4 states. [2018-12-02 03:08:24,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,212 INFO L93 Difference]: Finished difference Result 2176 states and 3198 transitions. [2018-12-02 03:08:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:24,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 03:08:24,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,215 INFO L225 Difference]: With dead ends: 2176 [2018-12-02 03:08:24,215 INFO L226 Difference]: Without dead ends: 1175 [2018-12-02 03:08:24,216 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-02 03:08:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-12-02 03:08:24,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2018-12-02 03:08:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-02 03:08:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1502 transitions. [2018-12-02 03:08:24,231 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1502 transitions. Word has length 145 [2018-12-02 03:08:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,231 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1502 transitions. [2018-12-02 03:08:24,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1502 transitions. [2018-12-02 03:08:24,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 03:08:24,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,232 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 1, 1, 1, 1] [2018-12-02 03:08:24,232 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash -561427072, now seen corresponding path program 1 times [2018-12-02 03:08:24,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:24,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,286 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-02 03:08:24,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:24,286 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:24,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:24,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:24,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:24,287 INFO L87 Difference]: Start difference. First operand 1014 states and 1502 transitions. Second operand 4 states. [2018-12-02 03:08:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,446 INFO L93 Difference]: Finished difference Result 2015 states and 2994 transitions. [2018-12-02 03:08:24,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:24,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 03:08:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,449 INFO L225 Difference]: With dead ends: 2015 [2018-12-02 03:08:24,449 INFO L226 Difference]: Without dead ends: 1187 [2018-12-02 03:08:24,449 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-02 03:08:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-12-02 03:08:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1104. [2018-12-02 03:08:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-02 03:08:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1652 transitions. [2018-12-02 03:08:24,462 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1652 transitions. Word has length 145 [2018-12-02 03:08:24,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,463 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1652 transitions. [2018-12-02 03:08:24,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:24,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1652 transitions. [2018-12-02 03:08:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 03:08:24,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,464 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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, 1] [2018-12-02 03:08:24,464 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1284546930, now seen corresponding path program 1 times [2018-12-02 03:08:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:24,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:24,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:24,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:24,509 INFO L87 Difference]: Start difference. First operand 1104 states and 1652 transitions. Second operand 4 states. [2018-12-02 03:08:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,668 INFO L93 Difference]: Finished difference Result 2356 states and 3486 transitions. [2018-12-02 03:08:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:24,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-02 03:08:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,671 INFO L225 Difference]: With dead ends: 2356 [2018-12-02 03:08:24,671 INFO L226 Difference]: Without dead ends: 1265 [2018-12-02 03:08:24,672 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-02 03:08:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-12-02 03:08:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2018-12-02 03:08:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-02 03:08:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1646 transitions. [2018-12-02 03:08:24,687 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1646 transitions. Word has length 146 [2018-12-02 03:08:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,688 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1646 transitions. [2018-12-02 03:08:24,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1646 transitions. [2018-12-02 03:08:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-02 03:08:24,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,689 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:24,689 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1534513346, now seen corresponding path program 1 times [2018-12-02 03:08:24,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:24,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:24,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:24,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:24,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:24,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:24,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:24,735 INFO L87 Difference]: Start difference. First operand 1104 states and 1646 transitions. Second operand 4 states. [2018-12-02 03:08:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:24,889 INFO L93 Difference]: Finished difference Result 2356 states and 3474 transitions. [2018-12-02 03:08:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:24,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-02 03:08:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:24,892 INFO L225 Difference]: With dead ends: 2356 [2018-12-02 03:08:24,892 INFO L226 Difference]: Without dead ends: 1265 [2018-12-02 03:08:24,893 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-02 03:08:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-12-02 03:08:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2018-12-02 03:08:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-02 03:08:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1640 transitions. [2018-12-02 03:08:24,909 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1640 transitions. Word has length 147 [2018-12-02 03:08:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:24,909 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1640 transitions. [2018-12-02 03:08:24,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1640 transitions. [2018-12-02 03:08:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 03:08:24,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:24,910 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:24,910 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:24,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash -449136521, now seen corresponding path program 1 times [2018-12-02 03:08:24,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:24,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:24,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:24,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:24,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:24,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:24,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:24,947 INFO L87 Difference]: Start difference. First operand 1104 states and 1640 transitions. Second operand 4 states. [2018-12-02 03:08:25,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:25,094 INFO L93 Difference]: Finished difference Result 2302 states and 3396 transitions. [2018-12-02 03:08:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:25,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 03:08:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:25,097 INFO L225 Difference]: With dead ends: 2302 [2018-12-02 03:08:25,097 INFO L226 Difference]: Without dead ends: 1211 [2018-12-02 03:08:25,098 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-02 03:08:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-12-02 03:08:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2018-12-02 03:08:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-02 03:08:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1634 transitions. [2018-12-02 03:08:25,113 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1634 transitions. Word has length 148 [2018-12-02 03:08:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:25,113 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1634 transitions. [2018-12-02 03:08:25,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1634 transitions. [2018-12-02 03:08:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 03:08:25,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:25,115 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:25,115 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:25,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1587006100, now seen corresponding path program 1 times [2018-12-02 03:08:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-02 03:08:25,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:25,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:25,194 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-02 03:08:25,196 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:25,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:25,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:25,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:25,619 INFO L272 AbstractInterpreter]: Visited 65 different actions 227 times. Merged at 39 different actions 136 times. Never widened. Performed 1725 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1725 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 15 different actions. Largest state had 100 variables. [2018-12-02 03:08:25,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:25,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:25,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:25,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:25,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:25,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:25,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:25,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:25,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:25,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:25,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:25,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:25,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,795 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,809 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:25,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:25,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:25,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:25,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:25,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:25,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:25,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:25,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 03:08:25,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:25,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 183 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-02 03:08:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-02 03:08:25,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:25,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:25,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:25,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:08:25,955 INFO L87 Difference]: Start difference. First operand 1104 states and 1634 transitions. Second operand 4 states. [2018-12-02 03:08:26,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:26,164 INFO L93 Difference]: Finished difference Result 2302 states and 3384 transitions. [2018-12-02 03:08:26,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:26,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 03:08:26,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:26,167 INFO L225 Difference]: With dead ends: 2302 [2018-12-02 03:08:26,167 INFO L226 Difference]: Without dead ends: 1211 [2018-12-02 03:08:26,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:08:26,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-12-02 03:08:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2018-12-02 03:08:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-02 03:08:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1628 transitions. [2018-12-02 03:08:26,188 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1628 transitions. Word has length 148 [2018-12-02 03:08:26,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:26,188 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1628 transitions. [2018-12-02 03:08:26,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:26,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1628 transitions. [2018-12-02 03:08:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 03:08:26,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:26,190 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:26,190 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:26,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2094586744, now seen corresponding path program 1 times [2018-12-02 03:08:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:26,238 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-02 03:08:26,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:26,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:26,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:26,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:26,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:26,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:26,239 INFO L87 Difference]: Start difference. First operand 1104 states and 1628 transitions. Second operand 4 states. [2018-12-02 03:08:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:26,432 INFO L93 Difference]: Finished difference Result 2474 states and 3658 transitions. [2018-12-02 03:08:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:26,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 03:08:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:26,435 INFO L225 Difference]: With dead ends: 2474 [2018-12-02 03:08:26,435 INFO L226 Difference]: Without dead ends: 1383 [2018-12-02 03:08:26,436 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-02 03:08:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-12-02 03:08:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1236. [2018-12-02 03:08:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-12-02 03:08:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1856 transitions. [2018-12-02 03:08:26,457 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1856 transitions. Word has length 148 [2018-12-02 03:08:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:26,457 INFO L480 AbstractCegarLoop]: Abstraction has 1236 states and 1856 transitions. [2018-12-02 03:08:26,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1856 transitions. [2018-12-02 03:08:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 03:08:26,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:26,458 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:26,458 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:26,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 544458815, now seen corresponding path program 1 times [2018-12-02 03:08:26,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:26,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:26,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:26,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 201 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-02 03:08:26,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:26,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:26,539 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-12-02 03:08:26,540 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:26,542 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:26,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:26,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:26,747 INFO L272 AbstractInterpreter]: Visited 66 different actions 232 times. Merged at 39 different actions 136 times. Never widened. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 16 different actions. Largest state had 100 variables. [2018-12-02 03:08:26,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:26,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:26,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:26,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:26,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:26,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:26,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:26,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:26,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:26,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:26,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:26,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:26,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:26,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:26,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:26,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:26,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:26,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 03:08:26,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:26,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:26,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 03:08:26,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:26,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 187 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-02 03:08:27,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-02 03:08:27,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:27,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-02 03:08:27,003 INFO L87 Difference]: Start difference. First operand 1236 states and 1856 transitions. Second operand 4 states. [2018-12-02 03:08:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,170 INFO L93 Difference]: Finished difference Result 2544 states and 3797 transitions. [2018-12-02 03:08:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:27,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-02 03:08:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,172 INFO L225 Difference]: With dead ends: 2544 [2018-12-02 03:08:27,173 INFO L226 Difference]: Without dead ends: 1321 [2018-12-02 03:08:27,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-02 03:08:27,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-12-02 03:08:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1236. [2018-12-02 03:08:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-12-02 03:08:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1850 transitions. [2018-12-02 03:08:27,194 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1850 transitions. Word has length 149 [2018-12-02 03:08:27,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 1236 states and 1850 transitions. [2018-12-02 03:08:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1850 transitions. [2018-12-02 03:08:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 03:08:27,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:27,195 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 03:08:27,195 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:27,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1664061798, now seen corresponding path program 1 times [2018-12-02 03:08:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:27,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:27,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:27,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:27,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:27,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:27,245 INFO L87 Difference]: Start difference. First operand 1236 states and 1850 transitions. Second operand 4 states. [2018-12-02 03:08:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,520 INFO L93 Difference]: Finished difference Result 3016 states and 4520 transitions. [2018-12-02 03:08:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:27,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 03:08:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,525 INFO L225 Difference]: With dead ends: 3016 [2018-12-02 03:08:27,526 INFO L226 Difference]: Without dead ends: 1793 [2018-12-02 03:08:27,527 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-02 03:08:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-12-02 03:08:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1386. [2018-12-02 03:08:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2018-12-02 03:08:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2108 transitions. [2018-12-02 03:08:27,550 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2108 transitions. Word has length 152 [2018-12-02 03:08:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:27,550 INFO L480 AbstractCegarLoop]: Abstraction has 1386 states and 2108 transitions. [2018-12-02 03:08:27,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2108 transitions. [2018-12-02 03:08:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 03:08:27,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:27,551 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 03:08:27,551 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:27,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1798075304, now seen corresponding path program 1 times [2018-12-02 03:08:27,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:27,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:27,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,552 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:27,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:27,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:27,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:27,592 INFO L87 Difference]: Start difference. First operand 1386 states and 2108 transitions. Second operand 4 states. [2018-12-02 03:08:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:27,883 INFO L93 Difference]: Finished difference Result 3310 states and 5030 transitions. [2018-12-02 03:08:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:27,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 03:08:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:27,887 INFO L225 Difference]: With dead ends: 3310 [2018-12-02 03:08:27,887 INFO L226 Difference]: Without dead ends: 1937 [2018-12-02 03:08:27,890 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-02 03:08:27,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-12-02 03:08:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1380. [2018-12-02 03:08:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2018-12-02 03:08:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2102 transitions. [2018-12-02 03:08:27,915 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2102 transitions. Word has length 152 [2018-12-02 03:08:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:27,916 INFO L480 AbstractCegarLoop]: Abstraction has 1380 states and 2102 transitions. [2018-12-02 03:08:27,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2102 transitions. [2018-12-02 03:08:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 03:08:27,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:27,917 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 03:08:27,917 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:27,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:27,917 INFO L82 PathProgramCache]: Analyzing trace with hash -50726115, now seen corresponding path program 1 times [2018-12-02 03:08:27,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:27,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:27,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:27,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:27,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:27,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:27,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:27,969 INFO L87 Difference]: Start difference. First operand 1380 states and 2102 transitions. Second operand 4 states. [2018-12-02 03:08:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:28,270 INFO L93 Difference]: Finished difference Result 3284 states and 4998 transitions. [2018-12-02 03:08:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:28,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 03:08:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:28,272 INFO L225 Difference]: With dead ends: 3284 [2018-12-02 03:08:28,272 INFO L226 Difference]: Without dead ends: 1917 [2018-12-02 03:08:28,274 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-02 03:08:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-12-02 03:08:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1511. [2018-12-02 03:08:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-12-02 03:08:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2326 transitions. [2018-12-02 03:08:28,301 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2326 transitions. Word has length 153 [2018-12-02 03:08:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:28,301 INFO L480 AbstractCegarLoop]: Abstraction has 1511 states and 2326 transitions. [2018-12-02 03:08:28,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2326 transitions. [2018-12-02 03:08:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 03:08:28,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:28,303 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 03:08:28,303 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:28,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,303 INFO L82 PathProgramCache]: Analyzing trace with hash 89822495, now seen corresponding path program 1 times [2018-12-02 03:08:28,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:28,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:28,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:28,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:28,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:28,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:28,363 INFO L87 Difference]: Start difference. First operand 1511 states and 2326 transitions. Second operand 4 states. [2018-12-02 03:08:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:28,659 INFO L93 Difference]: Finished difference Result 3396 states and 5188 transitions. [2018-12-02 03:08:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:28,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 03:08:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:28,663 INFO L225 Difference]: With dead ends: 3396 [2018-12-02 03:08:28,663 INFO L226 Difference]: Without dead ends: 1898 [2018-12-02 03:08:28,665 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-02 03:08:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-02 03:08:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1361. [2018-12-02 03:08:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-02 03:08:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2068 transitions. [2018-12-02 03:08:28,706 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2068 transitions. Word has length 153 [2018-12-02 03:08:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:28,706 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2068 transitions. [2018-12-02 03:08:28,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2068 transitions. [2018-12-02 03:08:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 03:08:28,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:28,708 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1] [2018-12-02 03:08:28,708 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:28,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1384147662, now seen corresponding path program 1 times [2018-12-02 03:08:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:28,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:28,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:28,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:28,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:28,770 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:28,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:28,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:28,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:28,771 INFO L87 Difference]: Start difference. First operand 1361 states and 2068 transitions. Second operand 4 states. [2018-12-02 03:08:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:29,006 INFO L93 Difference]: Finished difference Result 3240 states and 4918 transitions. [2018-12-02 03:08:29,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:29,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 03:08:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:29,010 INFO L225 Difference]: With dead ends: 3240 [2018-12-02 03:08:29,010 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:29,012 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-02 03:08:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1433. [2018-12-02 03:08:29,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-02 03:08:29,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2170 transitions. [2018-12-02 03:08:29,048 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2170 transitions. Word has length 167 [2018-12-02 03:08:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:29,048 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2170 transitions. [2018-12-02 03:08:29,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2170 transitions. [2018-12-02 03:08:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 03:08:29,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:29,049 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:29,050 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:29,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1402803120, now seen corresponding path program 1 times [2018-12-02 03:08:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:29,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:29,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:29,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:29,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:29,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:29,115 INFO L87 Difference]: Start difference. First operand 1433 states and 2170 transitions. Second operand 4 states. [2018-12-02 03:08:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:29,353 INFO L93 Difference]: Finished difference Result 3312 states and 5014 transitions. [2018-12-02 03:08:29,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:29,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 03:08:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:29,355 INFO L225 Difference]: With dead ends: 3312 [2018-12-02 03:08:29,355 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:29,357 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-02 03:08:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1439. [2018-12-02 03:08:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-02 03:08:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2176 transitions. [2018-12-02 03:08:29,384 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2176 transitions. Word has length 167 [2018-12-02 03:08:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:29,384 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2176 transitions. [2018-12-02 03:08:29,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2176 transitions. [2018-12-02 03:08:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 03:08:29,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:29,385 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1] [2018-12-02 03:08:29,385 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:29,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1065452468, now seen corresponding path program 1 times [2018-12-02 03:08:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:29,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:29,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:29,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:29,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:29,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:29,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:29,432 INFO L87 Difference]: Start difference. First operand 1439 states and 2176 transitions. Second operand 4 states. [2018-12-02 03:08:29,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:29,695 INFO L93 Difference]: Finished difference Result 3318 states and 5014 transitions. [2018-12-02 03:08:29,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:29,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 03:08:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:29,699 INFO L225 Difference]: With dead ends: 3318 [2018-12-02 03:08:29,699 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:29,701 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-02 03:08:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1439. [2018-12-02 03:08:29,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-02 03:08:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2170 transitions. [2018-12-02 03:08:29,748 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2170 transitions. Word has length 167 [2018-12-02 03:08:29,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:29,749 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2170 transitions. [2018-12-02 03:08:29,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2170 transitions. [2018-12-02 03:08:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 03:08:29,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:29,751 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:29,751 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:29,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:29,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1046797010, now seen corresponding path program 1 times [2018-12-02 03:08:29,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:29,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:29,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:29,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:29,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:29,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:29,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:29,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:29,821 INFO L87 Difference]: Start difference. First operand 1439 states and 2170 transitions. Second operand 4 states. [2018-12-02 03:08:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:30,065 INFO L93 Difference]: Finished difference Result 3318 states and 5002 transitions. [2018-12-02 03:08:30,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:30,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 03:08:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:30,067 INFO L225 Difference]: With dead ends: 3318 [2018-12-02 03:08:30,067 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:30,069 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-02 03:08:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-02 03:08:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-02 03:08:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2056 transitions. [2018-12-02 03:08:30,096 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2056 transitions. Word has length 167 [2018-12-02 03:08:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:30,096 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2056 transitions. [2018-12-02 03:08:30,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2056 transitions. [2018-12-02 03:08:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 03:08:30,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:30,097 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:30,098 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:30,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -63656531, now seen corresponding path program 1 times [2018-12-02 03:08:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:30,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:30,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:30,142 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:30,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:30,142 INFO L87 Difference]: Start difference. First operand 1361 states and 2056 transitions. Second operand 4 states. [2018-12-02 03:08:30,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:30,386 INFO L93 Difference]: Finished difference Result 3240 states and 4882 transitions. [2018-12-02 03:08:30,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:30,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-02 03:08:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:30,388 INFO L225 Difference]: With dead ends: 3240 [2018-12-02 03:08:30,388 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:30,389 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-02 03:08:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1445. [2018-12-02 03:08:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-02 03:08:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2170 transitions. [2018-12-02 03:08:30,418 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2170 transitions. Word has length 168 [2018-12-02 03:08:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:30,418 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 2170 transitions. [2018-12-02 03:08:30,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2170 transitions. [2018-12-02 03:08:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 03:08:30,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:30,420 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:30,420 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:30,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1435463829, now seen corresponding path program 1 times [2018-12-02 03:08:30,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:30,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:30,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:30,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:30,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:30,470 INFO L87 Difference]: Start difference. First operand 1445 states and 2170 transitions. Second operand 4 states. [2018-12-02 03:08:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:30,704 INFO L93 Difference]: Finished difference Result 3324 states and 4990 transitions. [2018-12-02 03:08:30,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:30,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-02 03:08:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:30,706 INFO L225 Difference]: With dead ends: 3324 [2018-12-02 03:08:30,706 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:30,707 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-02 03:08:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-02 03:08:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-02 03:08:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2050 transitions. [2018-12-02 03:08:30,737 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2050 transitions. Word has length 168 [2018-12-02 03:08:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:30,738 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2050 transitions. [2018-12-02 03:08:30,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2050 transitions. [2018-12-02 03:08:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-02 03:08:30,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:30,739 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:30,739 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:30,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:30,739 INFO L82 PathProgramCache]: Analyzing trace with hash 254214453, now seen corresponding path program 1 times [2018-12-02 03:08:30,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:30,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:30,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:30,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:30,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:30,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:30,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:30,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:30,791 INFO L87 Difference]: Start difference. First operand 1361 states and 2050 transitions. Second operand 4 states. [2018-12-02 03:08:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:31,056 INFO L93 Difference]: Finished difference Result 3240 states and 4864 transitions. [2018-12-02 03:08:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:31,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-02 03:08:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:31,059 INFO L225 Difference]: With dead ends: 3240 [2018-12-02 03:08:31,059 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:31,060 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-02 03:08:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1451. [2018-12-02 03:08:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-12-02 03:08:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2170 transitions. [2018-12-02 03:08:31,109 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2170 transitions. Word has length 169 [2018-12-02 03:08:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:31,109 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 2170 transitions. [2018-12-02 03:08:31,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2170 transitions. [2018-12-02 03:08:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-02 03:08:31,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:31,110 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:31,110 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:31,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:31,111 INFO L82 PathProgramCache]: Analyzing trace with hash 677861175, now seen corresponding path program 1 times [2018-12-02 03:08:31,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:31,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:31,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:31,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:31,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:31,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:31,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:31,152 INFO L87 Difference]: Start difference. First operand 1451 states and 2170 transitions. Second operand 4 states. [2018-12-02 03:08:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:31,408 INFO L93 Difference]: Finished difference Result 3330 states and 4978 transitions. [2018-12-02 03:08:31,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:31,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-02 03:08:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:31,410 INFO L225 Difference]: With dead ends: 3330 [2018-12-02 03:08:31,410 INFO L226 Difference]: Without dead ends: 1892 [2018-12-02 03:08:31,411 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-02 03:08:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-02 03:08:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-02 03:08:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-02 03:08:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2044 transitions. [2018-12-02 03:08:31,454 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2044 transitions. Word has length 169 [2018-12-02 03:08:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:31,454 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2044 transitions. [2018-12-02 03:08:31,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2044 transitions. [2018-12-02 03:08:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 03:08:31,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:31,455 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:31,455 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:31,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:31,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1022687246, now seen corresponding path program 1 times [2018-12-02 03:08:31,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:31,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:31,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:31,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:31,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:31,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:31,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:31,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:31,501 INFO L87 Difference]: Start difference. First operand 1361 states and 2044 transitions. Second operand 4 states. [2018-12-02 03:08:31,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:31,747 INFO L93 Difference]: Finished difference Result 3186 states and 4780 transitions. [2018-12-02 03:08:31,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:31,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-02 03:08:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:31,748 INFO L225 Difference]: With dead ends: 3186 [2018-12-02 03:08:31,749 INFO L226 Difference]: Without dead ends: 1838 [2018-12-02 03:08:31,750 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-02 03:08:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-02 03:08:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1457. [2018-12-02 03:08:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-12-02 03:08:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2170 transitions. [2018-12-02 03:08:31,783 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2170 transitions. Word has length 170 [2018-12-02 03:08:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:31,783 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 2170 transitions. [2018-12-02 03:08:31,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2170 transitions. [2018-12-02 03:08:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-02 03:08:31,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:31,784 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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, 1] [2018-12-02 03:08:31,784 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:31,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:31,784 INFO L82 PathProgramCache]: Analyzing trace with hash -774540752, now seen corresponding path program 1 times [2018-12-02 03:08:31,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:31,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:31,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:31,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:31,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:31,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:31,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:31,832 INFO L87 Difference]: Start difference. First operand 1457 states and 2170 transitions. Second operand 4 states. [2018-12-02 03:08:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:32,075 INFO L93 Difference]: Finished difference Result 3282 states and 4900 transitions. [2018-12-02 03:08:32,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:32,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-02 03:08:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:32,077 INFO L225 Difference]: With dead ends: 3282 [2018-12-02 03:08:32,077 INFO L226 Difference]: Without dead ends: 1838 [2018-12-02 03:08:32,079 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-02 03:08:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-02 03:08:32,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1361. [2018-12-02 03:08:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-02 03:08:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2038 transitions. [2018-12-02 03:08:32,112 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2038 transitions. Word has length 170 [2018-12-02 03:08:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:32,112 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2038 transitions. [2018-12-02 03:08:32,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2038 transitions. [2018-12-02 03:08:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 03:08:32,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:32,113 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:32,113 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:32,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:32,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1140730340, now seen corresponding path program 1 times [2018-12-02 03:08:32,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:32,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:32,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:32,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:32,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:32,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:32,157 INFO L87 Difference]: Start difference. First operand 1361 states and 2038 transitions. Second operand 4 states. [2018-12-02 03:08:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:32,396 INFO L93 Difference]: Finished difference Result 3186 states and 4762 transitions. [2018-12-02 03:08:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:32,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 03:08:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:32,398 INFO L225 Difference]: With dead ends: 3186 [2018-12-02 03:08:32,398 INFO L226 Difference]: Without dead ends: 1838 [2018-12-02 03:08:32,399 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-02 03:08:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-02 03:08:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1499. [2018-12-02 03:08:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-12-02 03:08:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2242 transitions. [2018-12-02 03:08:32,435 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2242 transitions. Word has length 173 [2018-12-02 03:08:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:32,435 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 2242 transitions. [2018-12-02 03:08:32,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2242 transitions. [2018-12-02 03:08:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 03:08:32,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:32,436 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:32,436 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:32,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2034216678, now seen corresponding path program 1 times [2018-12-02 03:08:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:32,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:32,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:32,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:32,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:32,500 INFO L87 Difference]: Start difference. First operand 1499 states and 2242 transitions. Second operand 4 states. [2018-12-02 03:08:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:32,764 INFO L93 Difference]: Finished difference Result 3334 states and 4980 transitions. [2018-12-02 03:08:32,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:32,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 03:08:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:32,766 INFO L225 Difference]: With dead ends: 3334 [2018-12-02 03:08:32,766 INFO L226 Difference]: Without dead ends: 1848 [2018-12-02 03:08:32,767 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-02 03:08:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-12-02 03:08:32,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1371. [2018-12-02 03:08:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-12-02 03:08:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2052 transitions. [2018-12-02 03:08:32,803 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2052 transitions. Word has length 173 [2018-12-02 03:08:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 1371 states and 2052 transitions. [2018-12-02 03:08:32,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2052 transitions. [2018-12-02 03:08:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 03:08:32,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:32,804 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:32,804 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:32,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:32,804 INFO L82 PathProgramCache]: Analyzing trace with hash 566394017, now seen corresponding path program 1 times [2018-12-02 03:08:32,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:32,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:32,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:32,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:32,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:32,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:32,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:32,851 INFO L87 Difference]: Start difference. First operand 1371 states and 2052 transitions. Second operand 4 states. [2018-12-02 03:08:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:33,085 INFO L93 Difference]: Finished difference Result 3188 states and 4763 transitions. [2018-12-02 03:08:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:33,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-02 03:08:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:33,086 INFO L225 Difference]: With dead ends: 3188 [2018-12-02 03:08:33,086 INFO L226 Difference]: Without dead ends: 1830 [2018-12-02 03:08:33,087 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-02 03:08:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-12-02 03:08:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1515. [2018-12-02 03:08:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-12-02 03:08:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2262 transitions. [2018-12-02 03:08:33,125 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2262 transitions. Word has length 174 [2018-12-02 03:08:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:33,126 INFO L480 AbstractCegarLoop]: Abstraction has 1515 states and 2262 transitions. [2018-12-02 03:08:33,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2262 transitions. [2018-12-02 03:08:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-02 03:08:33,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:33,127 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:33,127 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:33,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1800300577, now seen corresponding path program 1 times [2018-12-02 03:08:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:33,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:33,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:33,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:33,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:33,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:33,170 INFO L87 Difference]: Start difference. First operand 1515 states and 2262 transitions. Second operand 4 states. [2018-12-02 03:08:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:33,444 INFO L93 Difference]: Finished difference Result 3337 states and 4977 transitions. [2018-12-02 03:08:33,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:33,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-02 03:08:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:33,446 INFO L225 Difference]: With dead ends: 3337 [2018-12-02 03:08:33,446 INFO L226 Difference]: Without dead ends: 1835 [2018-12-02 03:08:33,447 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-02 03:08:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-12-02 03:08:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1376. [2018-12-02 03:08:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-12-02 03:08:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2056 transitions. [2018-12-02 03:08:33,485 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2056 transitions. Word has length 174 [2018-12-02 03:08:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:33,486 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 2056 transitions. [2018-12-02 03:08:33,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:33,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2056 transitions. [2018-12-02 03:08:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 03:08:33,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:33,487 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:33,487 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:33,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1380212793, now seen corresponding path program 1 times [2018-12-02 03:08:33,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:33,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:33,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 155 proven. 39 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-12-02 03:08:33,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:33,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:33,548 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-12-02 03:08:33,549 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:33,550 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:33,550 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:33,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:33,751 INFO L272 AbstractInterpreter]: Visited 76 different actions 225 times. Merged at 48 different actions 127 times. Never widened. Performed 1807 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 111 variables. [2018-12-02 03:08:33,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:33,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:33,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:33,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:33,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:33,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:33,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:33,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:33,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 03:08:33,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 03:08:33,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:33,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:33,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:33,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:33,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:33,875 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:33,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:33,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:33,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:33,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:33,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:33,914 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 155 proven. 39 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-12-02 03:08:33,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:33,919 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 03:08:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:33,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 03:08:33,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:33,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-02 03:08:33,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:33,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:33,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:33,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:33,950 INFO L87 Difference]: Start difference. First operand 1376 states and 2056 transitions. Second operand 4 states. [2018-12-02 03:08:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:34,185 INFO L93 Difference]: Finished difference Result 3284 states and 4920 transitions. [2018-12-02 03:08:34,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:34,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-12-02 03:08:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:34,187 INFO L225 Difference]: With dead ends: 3284 [2018-12-02 03:08:34,187 INFO L226 Difference]: Without dead ends: 1921 [2018-12-02 03:08:34,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:34,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-12-02 03:08:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1442. [2018-12-02 03:08:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-12-02 03:08:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2141 transitions. [2018-12-02 03:08:34,230 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2141 transitions. Word has length 182 [2018-12-02 03:08:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:34,230 INFO L480 AbstractCegarLoop]: Abstraction has 1442 states and 2141 transitions. [2018-12-02 03:08:34,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2141 transitions. [2018-12-02 03:08:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 03:08:34,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:34,231 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:34,231 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:34,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:34,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1361557335, now seen corresponding path program 1 times [2018-12-02 03:08:34,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 162 proven. 34 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-02 03:08:34,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:34,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:34,294 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-12-02 03:08:34,295 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [44], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:34,296 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:34,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:34,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:34,449 INFO L272 AbstractInterpreter]: Visited 75 different actions 221 times. Merged at 47 different actions 124 times. Never widened. Performed 1723 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1723 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 108 variables. [2018-12-02 03:08:34,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:34,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:34,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:34,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:34,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:34,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:34,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:34,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 03:08:34,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 03:08:34,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:34,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:34,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:34,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:34,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:34,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,545 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,554 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:34,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:34,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:34,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:34,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:34,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 162 proven. 34 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-02 03:08:34,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:34,599 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 03:08:34,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:34,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 03:08:34,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:34,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-02 03:08:34,626 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:34,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:34,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:34,626 INFO L87 Difference]: Start difference. First operand 1442 states and 2141 transitions. Second operand 4 states. [2018-12-02 03:08:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:34,879 INFO L93 Difference]: Finished difference Result 3354 states and 4993 transitions. [2018-12-02 03:08:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:34,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-12-02 03:08:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:34,881 INFO L225 Difference]: With dead ends: 3354 [2018-12-02 03:08:34,881 INFO L226 Difference]: Without dead ends: 1925 [2018-12-02 03:08:34,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-12-02 03:08:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1451. [2018-12-02 03:08:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-12-02 03:08:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2140 transitions. [2018-12-02 03:08:34,944 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2140 transitions. Word has length 182 [2018-12-02 03:08:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:34,945 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 2140 transitions. [2018-12-02 03:08:34,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2140 transitions. [2018-12-02 03:08:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 03:08:34,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:34,947 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:34,947 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:34,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -267828346, now seen corresponding path program 1 times [2018-12-02 03:08:34,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:34,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:34,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 169 proven. 29 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-02 03:08:34,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:34,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:34,997 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-12-02 03:08:34,997 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [49], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:34,999 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:34,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:35,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:35,153 INFO L272 AbstractInterpreter]: Visited 75 different actions 221 times. Merged at 47 different actions 124 times. Never widened. Performed 1932 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1932 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 108 variables. [2018-12-02 03:08:35,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:35,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:35,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:35,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:35,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:35,168 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:35,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:35,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:35,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 03:08:35,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 03:08:35,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:35,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:35,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:35,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:35,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:35,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,275 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:35,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:35,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:35,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:35,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:35,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 169 proven. 29 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-02 03:08:35,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:35,311 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 03:08:35,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:35,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-02 03:08:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:35,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-02 03:08:35,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:35,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:35,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:35,339 INFO L87 Difference]: Start difference. First operand 1451 states and 2140 transitions. Second operand 4 states. [2018-12-02 03:08:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:35,593 INFO L93 Difference]: Finished difference Result 3360 states and 4971 transitions. [2018-12-02 03:08:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:35,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-02 03:08:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:35,596 INFO L225 Difference]: With dead ends: 3360 [2018-12-02 03:08:35,596 INFO L226 Difference]: Without dead ends: 1925 [2018-12-02 03:08:35,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 364 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-12-02 03:08:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1457. [2018-12-02 03:08:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-12-02 03:08:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2135 transitions. [2018-12-02 03:08:35,642 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2135 transitions. Word has length 183 [2018-12-02 03:08:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:35,642 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 2135 transitions. [2018-12-02 03:08:35,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2135 transitions. [2018-12-02 03:08:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 03:08:35,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:35,643 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:35,644 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:35,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1698964166, now seen corresponding path program 1 times [2018-12-02 03:08:35,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:35,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:35,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:35,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:35,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:35,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:35,694 INFO L87 Difference]: Start difference. First operand 1457 states and 2135 transitions. Second operand 4 states. [2018-12-02 03:08:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:35,876 INFO L93 Difference]: Finished difference Result 3177 states and 4643 transitions. [2018-12-02 03:08:35,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:35,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-02 03:08:35,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:35,878 INFO L225 Difference]: With dead ends: 3177 [2018-12-02 03:08:35,878 INFO L226 Difference]: Without dead ends: 1736 [2018-12-02 03:08:35,879 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-02 03:08:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2018-12-02 03:08:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1631. [2018-12-02 03:08:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-12-02 03:08:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2387 transitions. [2018-12-02 03:08:35,925 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2387 transitions. Word has length 183 [2018-12-02 03:08:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:35,925 INFO L480 AbstractCegarLoop]: Abstraction has 1631 states and 2387 transitions. [2018-12-02 03:08:35,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2387 transitions. [2018-12-02 03:08:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 03:08:35,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:35,927 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:35,927 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:35,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:35,927 INFO L82 PathProgramCache]: Analyzing trace with hash -312178756, now seen corresponding path program 1 times [2018-12-02 03:08:35,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:35,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-02 03:08:36,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:36,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:36,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:36,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:36,040 INFO L87 Difference]: Start difference. First operand 1631 states and 2387 transitions. Second operand 6 states. [2018-12-02 03:08:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:36,357 INFO L93 Difference]: Finished difference Result 3069 states and 4495 transitions. [2018-12-02 03:08:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:36,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-12-02 03:08:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:36,359 INFO L225 Difference]: With dead ends: 3069 [2018-12-02 03:08:36,359 INFO L226 Difference]: Without dead ends: 1712 [2018-12-02 03:08:36,360 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-02 03:08:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2018-12-02 03:08:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1636. [2018-12-02 03:08:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-12-02 03:08:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2394 transitions. [2018-12-02 03:08:36,420 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2394 transitions. Word has length 183 [2018-12-02 03:08:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:36,420 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2394 transitions. [2018-12-02 03:08:36,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2394 transitions. [2018-12-02 03:08:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-02 03:08:36,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:36,422 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:36,422 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:36,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:36,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1999870089, now seen corresponding path program 1 times [2018-12-02 03:08:36,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-02 03:08:36,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:36,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 03:08:36,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:36,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 03:08:36,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 03:08:36,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 03:08:36,496 INFO L87 Difference]: Start difference. First operand 1636 states and 2394 transitions. Second operand 6 states. [2018-12-02 03:08:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:36,786 INFO L93 Difference]: Finished difference Result 3066 states and 4491 transitions. [2018-12-02 03:08:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:08:36,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-12-02 03:08:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:36,788 INFO L225 Difference]: With dead ends: 3066 [2018-12-02 03:08:36,788 INFO L226 Difference]: Without dead ends: 1709 [2018-12-02 03:08:36,789 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-02 03:08:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2018-12-02 03:08:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1637. [2018-12-02 03:08:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-12-02 03:08:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2395 transitions. [2018-12-02 03:08:36,838 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2395 transitions. Word has length 184 [2018-12-02 03:08:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:36,839 INFO L480 AbstractCegarLoop]: Abstraction has 1637 states and 2395 transitions. [2018-12-02 03:08:36,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 03:08:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2395 transitions. [2018-12-02 03:08:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-02 03:08:36,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:36,840 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:36,840 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:36,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1133233986, now seen corresponding path program 1 times [2018-12-02 03:08:36,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:36,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:36,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:36,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:36,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:36,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:36,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:36,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:36,929 INFO L87 Difference]: Start difference. First operand 1637 states and 2395 transitions. Second operand 4 states. [2018-12-02 03:08:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:37,230 INFO L93 Difference]: Finished difference Result 3809 states and 5580 transitions. [2018-12-02 03:08:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:37,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-12-02 03:08:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:37,232 INFO L225 Difference]: With dead ends: 3809 [2018-12-02 03:08:37,232 INFO L226 Difference]: Without dead ends: 2194 [2018-12-02 03:08:37,234 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-02 03:08:37,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-12-02 03:08:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1793. [2018-12-02 03:08:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-12-02 03:08:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2641 transitions. [2018-12-02 03:08:37,292 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2641 transitions. Word has length 198 [2018-12-02 03:08:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:37,292 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2641 transitions. [2018-12-02 03:08:37,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2641 transitions. [2018-12-02 03:08:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-02 03:08:37,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:37,293 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:37,293 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:37,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1267247492, now seen corresponding path program 1 times [2018-12-02 03:08:37,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:37,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:37,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:37,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:37,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:37,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:37,354 INFO L87 Difference]: Start difference. First operand 1793 states and 2641 transitions. Second operand 4 states. [2018-12-02 03:08:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:37,668 INFO L93 Difference]: Finished difference Result 4109 states and 6060 transitions. [2018-12-02 03:08:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:37,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-12-02 03:08:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:37,670 INFO L225 Difference]: With dead ends: 4109 [2018-12-02 03:08:37,671 INFO L226 Difference]: Without dead ends: 2338 [2018-12-02 03:08:37,672 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-02 03:08:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-12-02 03:08:37,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1787. [2018-12-02 03:08:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2018-12-02 03:08:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2635 transitions. [2018-12-02 03:08:37,725 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2635 transitions. Word has length 198 [2018-12-02 03:08:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:37,725 INFO L480 AbstractCegarLoop]: Abstraction has 1787 states and 2635 transitions. [2018-12-02 03:08:37,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2635 transitions. [2018-12-02 03:08:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 03:08:37,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:37,727 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:37,727 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:37,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:37,727 INFO L82 PathProgramCache]: Analyzing trace with hash 77977526, now seen corresponding path program 1 times [2018-12-02 03:08:37,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:37,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:37,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-02 03:08:37,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:37,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:37,804 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-12-02 03:08:37,804 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [54], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:37,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:37,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:38,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:38,064 INFO L272 AbstractInterpreter]: Visited 77 different actions 284 times. Merged at 49 different actions 173 times. Never widened. Performed 2317 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2317 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-02 03:08:38,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:38,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:38,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:38,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:38,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:38,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:38,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 03:08:38,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 03:08:38,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:38,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:38,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:38,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:38,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:38,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:38,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:38,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:38,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:38,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:38,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:38,208 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-02 03:08:38,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:38,212 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 03:08:38,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:38,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-02 03:08:38,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:38,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-02 03:08:38,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:38,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:38,241 INFO L87 Difference]: Start difference. First operand 1787 states and 2635 transitions. Second operand 4 states. [2018-12-02 03:08:38,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:38,510 INFO L93 Difference]: Finished difference Result 4020 states and 5941 transitions. [2018-12-02 03:08:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:38,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-02 03:08:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:38,513 INFO L225 Difference]: With dead ends: 4020 [2018-12-02 03:08:38,513 INFO L226 Difference]: Without dead ends: 2255 [2018-12-02 03:08:38,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 396 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2018-12-02 03:08:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1793. [2018-12-02 03:08:38,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-12-02 03:08:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2623 transitions. [2018-12-02 03:08:38,570 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2623 transitions. Word has length 199 [2018-12-02 03:08:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:38,570 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2623 transitions. [2018-12-02 03:08:38,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2623 transitions. [2018-12-02 03:08:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 03:08:38,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:38,572 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:38,572 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:38,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:38,573 INFO L82 PathProgramCache]: Analyzing trace with hash 766097269, now seen corresponding path program 1 times [2018-12-02 03:08:38,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:38,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:38,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:38,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:38,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:38,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:38,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:38,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:38,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:38,649 INFO L87 Difference]: Start difference. First operand 1793 states and 2623 transitions. Second operand 4 states. [2018-12-02 03:08:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:38,940 INFO L93 Difference]: Finished difference Result 4095 states and 5999 transitions. [2018-12-02 03:08:38,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:38,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-02 03:08:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:38,942 INFO L225 Difference]: With dead ends: 4095 [2018-12-02 03:08:38,942 INFO L226 Difference]: Without dead ends: 2324 [2018-12-02 03:08:38,944 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-02 03:08:38,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2018-12-02 03:08:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1922. [2018-12-02 03:08:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-12-02 03:08:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2821 transitions. [2018-12-02 03:08:39,000 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2821 transitions. Word has length 199 [2018-12-02 03:08:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:39,000 INFO L480 AbstractCegarLoop]: Abstraction has 1922 states and 2821 transitions. [2018-12-02 03:08:39,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2821 transitions. [2018-12-02 03:08:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-02 03:08:39,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:39,002 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:39,002 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 625548659, now seen corresponding path program 1 times [2018-12-02 03:08:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:39,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:39,051 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:39,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:39,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:39,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:39,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:39,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:39,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:39,052 INFO L87 Difference]: Start difference. First operand 1922 states and 2821 transitions. Second operand 4 states. [2018-12-02 03:08:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:39,360 INFO L93 Difference]: Finished difference Result 4203 states and 6161 transitions. [2018-12-02 03:08:39,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:39,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-02 03:08:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:39,362 INFO L225 Difference]: With dead ends: 4203 [2018-12-02 03:08:39,363 INFO L226 Difference]: Without dead ends: 2303 [2018-12-02 03:08:39,364 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-02 03:08:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2018-12-02 03:08:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 1772. [2018-12-02 03:08:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-12-02 03:08:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2587 transitions. [2018-12-02 03:08:39,422 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2587 transitions. Word has length 199 [2018-12-02 03:08:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:39,422 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 2587 transitions. [2018-12-02 03:08:39,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2587 transitions. [2018-12-02 03:08:39,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-02 03:08:39,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:39,425 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:39,425 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:39,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2103902609, now seen corresponding path program 1 times [2018-12-02 03:08:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:39,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:39,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-02 03:08:39,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:39,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:39,506 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-12-02 03:08:39,507 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [59], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:39,508 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:39,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:39,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:39,694 INFO L272 AbstractInterpreter]: Visited 77 different actions 284 times. Merged at 49 different actions 173 times. Never widened. Performed 2317 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2317 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-02 03:08:39,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:39,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:39,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:39,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:39,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:39,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:39,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:39,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-02 03:08:39,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 03:08:39,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 03:08:39,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 03:08:39,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 03:08:39,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:39,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:39,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:39,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,820 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-02 03:08:39,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:39,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:39,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:39,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:39,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-02 03:08:39,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:39,856 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 03:08:39,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:39,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-02 03:08:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-02 03:08:39,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 03:08:39,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-02 03:08:39,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:39,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:39,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 03:08:39,886 INFO L87 Difference]: Start difference. First operand 1772 states and 2587 transitions. Second operand 4 states. [2018-12-02 03:08:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:40,143 INFO L93 Difference]: Finished difference Result 3676 states and 5380 transitions. [2018-12-02 03:08:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:40,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-12-02 03:08:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:40,145 INFO L225 Difference]: With dead ends: 3676 [2018-12-02 03:08:40,145 INFO L226 Difference]: Without dead ends: 1926 [2018-12-02 03:08:40,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 03:08:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-12-02 03:08:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1543. [2018-12-02 03:08:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2018-12-02 03:08:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2230 transitions. [2018-12-02 03:08:40,199 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2230 transitions. Word has length 200 [2018-12-02 03:08:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:40,199 INFO L480 AbstractCegarLoop]: Abstraction has 1543 states and 2230 transitions. [2018-12-02 03:08:40,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2230 transitions. [2018-12-02 03:08:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-02 03:08:40,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:40,201 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:40,201 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1918946349, now seen corresponding path program 1 times [2018-12-02 03:08:40,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:40,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:40,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-02 03:08:40,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:40,257 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:40,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:40,258 INFO L87 Difference]: Start difference. First operand 1543 states and 2230 transitions. Second operand 4 states. [2018-12-02 03:08:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:40,496 INFO L93 Difference]: Finished difference Result 3214 states and 4652 transitions. [2018-12-02 03:08:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:40,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-12-02 03:08:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:40,498 INFO L225 Difference]: With dead ends: 3214 [2018-12-02 03:08:40,498 INFO L226 Difference]: Without dead ends: 1693 [2018-12-02 03:08:40,499 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-02 03:08:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-12-02 03:08:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1588. [2018-12-02 03:08:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2305 transitions. [2018-12-02 03:08:40,551 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2305 transitions. Word has length 204 [2018-12-02 03:08:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:40,551 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2305 transitions. [2018-12-02 03:08:40,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2305 transitions. [2018-12-02 03:08:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-02 03:08:40,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:40,552 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:40,552 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:40,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash -684916523, now seen corresponding path program 1 times [2018-12-02 03:08:40,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:40,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:40,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:40,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:40,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 361 proven. 1 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-12-02 03:08:40,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:40,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:40,648 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-02 03:08:40,648 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:40,649 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:40,649 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:40,796 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:40,797 INFO L272 AbstractInterpreter]: Visited 78 different actions 241 times. Merged at 52 different actions 137 times. Never widened. Performed 1958 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 17 different actions. Largest state had 111 variables. [2018-12-02 03:08:40,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:40,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:40,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:40,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:40,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:40,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:40,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:40,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:40,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:40,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:40,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:40,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:40,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:40,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:40,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:40,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:40,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:40,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:40,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:40,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 03:08:40,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 03:08:40,995 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:40,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:40,995 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:40,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:40,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:40,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:40,996 INFO L87 Difference]: Start difference. First operand 1588 states and 2305 transitions. Second operand 5 states. [2018-12-02 03:08:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:41,271 INFO L93 Difference]: Finished difference Result 3439 states and 5006 transitions. [2018-12-02 03:08:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:41,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 206 [2018-12-02 03:08:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:41,273 INFO L225 Difference]: With dead ends: 3439 [2018-12-02 03:08:41,273 INFO L226 Difference]: Without dead ends: 1873 [2018-12-02 03:08:41,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 408 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-12-02 03:08:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1598. [2018-12-02 03:08:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-02 03:08:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2320 transitions. [2018-12-02 03:08:41,327 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2320 transitions. Word has length 206 [2018-12-02 03:08:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:41,327 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2320 transitions. [2018-12-02 03:08:41,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2320 transitions. [2018-12-02 03:08:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-02 03:08:41,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:41,329 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:41,329 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:41,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash -566083999, now seen corresponding path program 1 times [2018-12-02 03:08:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:41,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-02 03:08:41,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:41,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:41,389 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:41,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:41,390 INFO L87 Difference]: Start difference. First operand 1598 states and 2320 transitions. Second operand 4 states. [2018-12-02 03:08:41,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:41,581 INFO L93 Difference]: Finished difference Result 3264 states and 4732 transitions. [2018-12-02 03:08:41,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:41,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-02 03:08:41,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:41,583 INFO L225 Difference]: With dead ends: 3264 [2018-12-02 03:08:41,583 INFO L226 Difference]: Without dead ends: 1688 [2018-12-02 03:08:41,584 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-02 03:08:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-12-02 03:08:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1598. [2018-12-02 03:08:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-02 03:08:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2315 transitions. [2018-12-02 03:08:41,655 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2315 transitions. Word has length 206 [2018-12-02 03:08:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:41,655 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2315 transitions. [2018-12-02 03:08:41,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2315 transitions. [2018-12-02 03:08:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-02 03:08:41,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:41,657 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:41,657 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:41,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash -983480605, now seen corresponding path program 1 times [2018-12-02 03:08:41,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:41,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:41,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:41,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-02 03:08:41,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:41,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:41,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:41,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:41,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:41,730 INFO L87 Difference]: Start difference. First operand 1598 states and 2315 transitions. Second operand 4 states. [2018-12-02 03:08:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:41,956 INFO L93 Difference]: Finished difference Result 3279 states and 4742 transitions. [2018-12-02 03:08:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:41,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-02 03:08:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:41,958 INFO L225 Difference]: With dead ends: 3279 [2018-12-02 03:08:41,958 INFO L226 Difference]: Without dead ends: 1703 [2018-12-02 03:08:41,959 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-02 03:08:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2018-12-02 03:08:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1598. [2018-12-02 03:08:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-02 03:08:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2310 transitions. [2018-12-02 03:08:42,013 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2310 transitions. Word has length 206 [2018-12-02 03:08:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:42,013 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2310 transitions. [2018-12-02 03:08:42,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2310 transitions. [2018-12-02 03:08:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:08:42,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:42,014 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:42,014 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:42,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash -194083888, now seen corresponding path program 1 times [2018-12-02 03:08:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:42,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:42,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-12-02 03:08:42,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:42,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:42,111 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-12-02 03:08:42,111 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [99], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:42,112 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:42,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:42,277 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:42,277 INFO L272 AbstractInterpreter]: Visited 79 different actions 245 times. Merged at 52 different actions 137 times. Never widened. Performed 1970 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-02 03:08:42,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:42,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:42,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:42,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:42,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:42,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:42,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:42,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:42,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:42,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:42,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:42,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:42,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:42,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:42,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:42,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:42,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:42,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 03:08:42,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 03:08:42,464 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:42,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:42,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:42,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:42,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:42,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:42,465 INFO L87 Difference]: Start difference. First operand 1598 states and 2310 transitions. Second operand 5 states. [2018-12-02 03:08:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:42,813 INFO L93 Difference]: Finished difference Result 3434 states and 4978 transitions. [2018-12-02 03:08:42,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:42,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-12-02 03:08:42,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:42,814 INFO L225 Difference]: With dead ends: 3434 [2018-12-02 03:08:42,814 INFO L226 Difference]: Without dead ends: 1858 [2018-12-02 03:08:42,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 410 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-12-02 03:08:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1603. [2018-12-02 03:08:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-02 03:08:42,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2315 transitions. [2018-12-02 03:08:42,870 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2315 transitions. Word has length 207 [2018-12-02 03:08:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:42,870 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2315 transitions. [2018-12-02 03:08:42,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2315 transitions. [2018-12-02 03:08:42,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:08:42,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:42,871 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:42,871 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:42,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:42,872 INFO L82 PathProgramCache]: Analyzing trace with hash -44226318, now seen corresponding path program 1 times [2018-12-02 03:08:42,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:42,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:42,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-02 03:08:42,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:42,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:42,926 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:42,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:42,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:42,927 INFO L87 Difference]: Start difference. First operand 1603 states and 2315 transitions. Second operand 4 states. [2018-12-02 03:08:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:43,129 INFO L93 Difference]: Finished difference Result 3249 states and 4688 transitions. [2018-12-02 03:08:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:43,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-02 03:08:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:43,130 INFO L225 Difference]: With dead ends: 3249 [2018-12-02 03:08:43,130 INFO L226 Difference]: Without dead ends: 1668 [2018-12-02 03:08:43,131 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-02 03:08:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-12-02 03:08:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1603. [2018-12-02 03:08:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-02 03:08:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2310 transitions. [2018-12-02 03:08:43,185 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2310 transitions. Word has length 207 [2018-12-02 03:08:43,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:43,186 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2310 transitions. [2018-12-02 03:08:43,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2310 transitions. [2018-12-02 03:08:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-02 03:08:43,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:43,187 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:43,187 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:43,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:43,187 INFO L82 PathProgramCache]: Analyzing trace with hash -98619216, now seen corresponding path program 1 times [2018-12-02 03:08:43,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:43,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-02 03:08:43,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:43,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:43,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:43,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:43,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:43,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:43,241 INFO L87 Difference]: Start difference. First operand 1603 states and 2310 transitions. Second operand 4 states. [2018-12-02 03:08:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:43,453 INFO L93 Difference]: Finished difference Result 3264 states and 4698 transitions. [2018-12-02 03:08:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:43,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-02 03:08:43,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:43,454 INFO L225 Difference]: With dead ends: 3264 [2018-12-02 03:08:43,454 INFO L226 Difference]: Without dead ends: 1683 [2018-12-02 03:08:43,455 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-02 03:08:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-12-02 03:08:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1603. [2018-12-02 03:08:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-02 03:08:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2305 transitions. [2018-12-02 03:08:43,511 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2305 transitions. Word has length 207 [2018-12-02 03:08:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:43,511 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2305 transitions. [2018-12-02 03:08:43,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2305 transitions. [2018-12-02 03:08:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 03:08:43,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:43,512 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:43,512 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:43,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash -267630020, now seen corresponding path program 1 times [2018-12-02 03:08:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:43,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:43,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:43,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:43,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:43,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:43,607 INFO L87 Difference]: Start difference. First operand 1603 states and 2305 transitions. Second operand 4 states. [2018-12-02 03:08:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:43,908 INFO L93 Difference]: Finished difference Result 3584 states and 5175 transitions. [2018-12-02 03:08:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:43,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-02 03:08:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:43,910 INFO L225 Difference]: With dead ends: 3584 [2018-12-02 03:08:43,910 INFO L226 Difference]: Without dead ends: 2003 [2018-12-02 03:08:43,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-02 03:08:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1718. [2018-12-02 03:08:43,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-12-02 03:08:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2475 transitions. [2018-12-02 03:08:43,977 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2475 transitions. Word has length 219 [2018-12-02 03:08:43,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:43,977 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 2475 transitions. [2018-12-02 03:08:43,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:43,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2475 transitions. [2018-12-02 03:08:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-02 03:08:43,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:43,978 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:43,978 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:43,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1161116358, now seen corresponding path program 1 times [2018-12-02 03:08:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:43,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:44,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:44,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:44,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:44,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:44,034 INFO L87 Difference]: Start difference. First operand 1718 states and 2475 transitions. Second operand 4 states. [2018-12-02 03:08:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:44,370 INFO L93 Difference]: Finished difference Result 3699 states and 5340 transitions. [2018-12-02 03:08:44,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:44,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-02 03:08:44,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:44,372 INFO L225 Difference]: With dead ends: 3699 [2018-12-02 03:08:44,372 INFO L226 Difference]: Without dead ends: 2003 [2018-12-02 03:08:44,373 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-02 03:08:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-02 03:08:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1603. [2018-12-02 03:08:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-02 03:08:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2300 transitions. [2018-12-02 03:08:44,431 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2300 transitions. Word has length 219 [2018-12-02 03:08:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:44,431 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2300 transitions. [2018-12-02 03:08:44,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2300 transitions. [2018-12-02 03:08:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-02 03:08:44,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:44,432 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:44,433 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:44,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:44,433 INFO L82 PathProgramCache]: Analyzing trace with hash -143104183, now seen corresponding path program 1 times [2018-12-02 03:08:44,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:44,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:44,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:44,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:44,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:44,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:44,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:44,519 INFO L87 Difference]: Start difference. First operand 1603 states and 2300 transitions. Second operand 4 states. [2018-12-02 03:08:44,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:44,811 INFO L93 Difference]: Finished difference Result 3569 states and 5142 transitions. [2018-12-02 03:08:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:44,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-12-02 03:08:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:44,813 INFO L225 Difference]: With dead ends: 3569 [2018-12-02 03:08:44,813 INFO L226 Difference]: Without dead ends: 1988 [2018-12-02 03:08:44,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:08:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-12-02 03:08:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1708. [2018-12-02 03:08:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2018-12-02 03:08:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2455 transitions. [2018-12-02 03:08:44,874 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2455 transitions. Word has length 220 [2018-12-02 03:08:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:44,874 INFO L480 AbstractCegarLoop]: Abstraction has 1708 states and 2455 transitions. [2018-12-02 03:08:44,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2455 transitions. [2018-12-02 03:08:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-02 03:08:44,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:44,875 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:44,875 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:44,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2071376885, now seen corresponding path program 1 times [2018-12-02 03:08:44,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:44,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:44,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:44,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-02 03:08:44,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:08:44,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 03:08:44,928 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:44,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 03:08:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 03:08:44,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 03:08:44,929 INFO L87 Difference]: Start difference. First operand 1708 states and 2455 transitions. Second operand 4 states. [2018-12-02 03:08:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:45,208 INFO L93 Difference]: Finished difference Result 3659 states and 5272 transitions. [2018-12-02 03:08:45,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 03:08:45,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-12-02 03:08:45,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:45,210 INFO L225 Difference]: With dead ends: 3659 [2018-12-02 03:08:45,210 INFO L226 Difference]: Without dead ends: 1973 [2018-12-02 03:08:45,211 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-02 03:08:45,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2018-12-02 03:08:45,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1588. [2018-12-02 03:08:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2275 transitions. [2018-12-02 03:08:45,272 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2275 transitions. Word has length 220 [2018-12-02 03:08:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:45,272 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2275 transitions. [2018-12-02 03:08:45,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 03:08:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2275 transitions. [2018-12-02 03:08:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 03:08:45,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:45,273 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:45,273 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:45,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1231144124, now seen corresponding path program 1 times [2018-12-02 03:08:45,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:45,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:45,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:45,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 03:08:45,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:45,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:45,382 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-02 03:08:45,382 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:45,383 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:45,383 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:45,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:45,631 INFO L272 AbstractInterpreter]: Visited 94 different actions 295 times. Merged at 65 different actions 174 times. Never widened. Performed 2676 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2676 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 19 different actions. Largest state had 136 variables. [2018-12-02 03:08:45,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:45,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:45,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:45,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:45,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:45,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:45,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:45,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:45,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:45,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:45,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:45,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:45,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:45,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:45,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:45,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:45,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:45,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:45,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:45,809 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:45,825 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:45,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:45,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:45,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:45,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:45,826 INFO L87 Difference]: Start difference. First operand 1588 states and 2275 transitions. Second operand 5 states. [2018-12-02 03:08:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:46,087 INFO L93 Difference]: Finished difference Result 3224 states and 4613 transitions. [2018-12-02 03:08:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:46,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-12-02 03:08:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:46,089 INFO L225 Difference]: With dead ends: 3224 [2018-12-02 03:08:46,089 INFO L226 Difference]: Without dead ends: 1658 [2018-12-02 03:08:46,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 440 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-12-02 03:08:46,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1588. [2018-12-02 03:08:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2270 transitions. [2018-12-02 03:08:46,151 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2270 transitions. Word has length 222 [2018-12-02 03:08:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:46,151 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2270 transitions. [2018-12-02 03:08:46,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2270 transitions. [2018-12-02 03:08:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-02 03:08:46,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:46,152 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:46,152 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:46,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1471383870, now seen corresponding path program 1 times [2018-12-02 03:08:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:46,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 03:08:46,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:46,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:46,255 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-02 03:08:46,255 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:46,256 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:46,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:46,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:46,526 INFO L272 AbstractInterpreter]: Visited 94 different actions 368 times. Merged at 66 different actions 237 times. Never widened. Performed 3045 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3045 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 20 different actions. Largest state had 136 variables. [2018-12-02 03:08:46,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:46,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:46,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:46,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:46,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:46,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:46,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:46,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:46,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:46,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:46,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:46,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:46,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:46,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:46,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:46,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:46,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:46,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:46,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:46,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:46,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:46,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:46,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:46,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:46,734 INFO L87 Difference]: Start difference. First operand 1588 states and 2270 transitions. Second operand 5 states. [2018-12-02 03:08:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:47,049 INFO L93 Difference]: Finished difference Result 3239 states and 4623 transitions. [2018-12-02 03:08:47,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:47,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-12-02 03:08:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:47,051 INFO L225 Difference]: With dead ends: 3239 [2018-12-02 03:08:47,051 INFO L226 Difference]: Without dead ends: 1673 [2018-12-02 03:08:47,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 440 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:47,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2018-12-02 03:08:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1588. [2018-12-02 03:08:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2265 transitions. [2018-12-02 03:08:47,114 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2265 transitions. Word has length 222 [2018-12-02 03:08:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:47,114 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2265 transitions. [2018-12-02 03:08:47,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2265 transitions. [2018-12-02 03:08:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-02 03:08:47,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:47,116 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:47,116 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:47,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:47,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1343437651, now seen corresponding path program 1 times [2018-12-02 03:08:47,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:47,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:47,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:47,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:47,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:47,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:47,220 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-02 03:08:47,220 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:47,221 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:47,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:47,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:47,516 INFO L272 AbstractInterpreter]: Visited 95 different actions 373 times. Merged at 66 different actions 237 times. Never widened. Performed 3389 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3389 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-02 03:08:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:47,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:47,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:47,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:47,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:47,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:47,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:47,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:47,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:47,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:47,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:47,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:47,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:47,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:47,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:47,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:47,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:47,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:47,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:47,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:47,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:47,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:47,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:47,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:47,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:47,709 INFO L87 Difference]: Start difference. First operand 1588 states and 2265 transitions. Second operand 5 states. [2018-12-02 03:08:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:47,972 INFO L93 Difference]: Finished difference Result 3204 states and 4564 transitions. [2018-12-02 03:08:47,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:47,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-12-02 03:08:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:47,973 INFO L225 Difference]: With dead ends: 3204 [2018-12-02 03:08:47,973 INFO L226 Difference]: Without dead ends: 1638 [2018-12-02 03:08:47,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 442 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:47,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2018-12-02 03:08:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1588. [2018-12-02 03:08:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2260 transitions. [2018-12-02 03:08:48,035 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2260 transitions. Word has length 223 [2018-12-02 03:08:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:48,035 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2260 transitions. [2018-12-02 03:08:48,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2260 transitions. [2018-12-02 03:08:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-02 03:08:48,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:48,036 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:48,036 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:48,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1809027179, now seen corresponding path program 1 times [2018-12-02 03:08:48,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:48,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:48,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-02 03:08:48,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:48,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 03:08:48,160 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-02 03:08:48,160 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-02 03:08:48,161 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 03:08:48,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 03:08:48,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 03:08:48,473 INFO L272 AbstractInterpreter]: Visited 95 different actions 373 times. Merged at 66 different actions 237 times. Never widened. Performed 3389 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3389 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-02 03:08:48,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:48,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 03:08:48,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 03:08:48,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 03:08:48,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:48,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 03:08:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:08:48,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 03:08:48,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 03:08:48,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 03:08:48,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 03:08:48,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-02 03:08:48,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:48,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:48,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 03:08:48,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-02 03:08:48,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-02 03:08:48,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:48,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 03:08:48,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-02 03:08:48,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 03:08:48,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-02 03:08:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:48,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 03:08:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-02 03:08:48,667 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 03:08:48,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-02 03:08:48,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 03:08:48,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 03:08:48,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:08:48,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 03:08:48,668 INFO L87 Difference]: Start difference. First operand 1588 states and 2260 transitions. Second operand 5 states. [2018-12-02 03:08:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:08:48,909 INFO L93 Difference]: Finished difference Result 3219 states and 4574 transitions. [2018-12-02 03:08:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 03:08:48,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-12-02 03:08:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 03:08:48,911 INFO L225 Difference]: With dead ends: 3219 [2018-12-02 03:08:48,911 INFO L226 Difference]: Without dead ends: 1653 [2018-12-02 03:08:48,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 442 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 03:08:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-02 03:08:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1588. [2018-12-02 03:08:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-02 03:08:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2255 transitions. [2018-12-02 03:08:48,973 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2255 transitions. Word has length 223 [2018-12-02 03:08:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 03:08:48,973 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2255 transitions. [2018-12-02 03:08:48,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 03:08:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2255 transitions. [2018-12-02 03:08:48,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-02 03:08:48,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 03:08:48,974 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:08:48,974 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 03:08:48,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:08:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1461231581, now seen corresponding path program 1 times [2018-12-02 03:08:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 03:08:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:08:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:08:48,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 03:08:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:08:49,946 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 03:08:50,002 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20486 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-02 03:08:50,003 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20494 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-02 03:08:50,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:08:50 BoogieIcfgContainer [2018-12-02 03:08:50,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 03:08:50,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:08:50,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:08:50,070 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:08:50,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:17" (3/4) ... [2018-12-02 03:08:50,073 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 03:08:50,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:08:50,073 INFO L168 Benchmark]: Toolchain (without parser) took 33198.88 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 948.1 MB in the beginning and 1.6 GB in the end (delta: -646.3 MB). Peak memory consumption was 445.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,074 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:50,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,075 INFO L168 Benchmark]: Boogie Preprocessor took 43.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,075 INFO L168 Benchmark]: RCFGBuilder took 602.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.2 MB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,075 INFO L168 Benchmark]: TraceAbstraction took 32157.80 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 986.7 MB). Free memory was 999.2 MB in the beginning and 1.6 GB in the end (delta: -595.2 MB). Peak memory consumption was 391.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:50,075 INFO L168 Benchmark]: Witness Printer took 3.14 ms. Allocated memory is still 2.1 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:08:50,076 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -141.8 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 602.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.2 MB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32157.80 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 986.7 MB). Free memory was 999.2 MB in the beginning and 1.6 GB in the end (delta: -595.2 MB). Peak memory consumption was 391.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.14 ms. Allocated memory is still 2.1 GB. Free memory is still 1.6 GB. 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 20486 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 20494 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)=20546, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20497: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={20506:0}, SSLv3_client_data={20497: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=12292, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->version=1, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->init_buf={-1:2}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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=20487, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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=20487, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->hit=0, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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=20487, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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=20543, (s->s3)->tmp.new_cipher={20506:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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=20487, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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=20487, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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=20487, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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 [L1392] blastFlag = 5 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1396] COND FALSE !(ret <= 0) [L1401] EXPR s->s3 [L1401] (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1401] COND FALSE !((s->s3)->tmp.cert_req) [L1404] s->state = 4480 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1406] s->init_num = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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=20487, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1197] COND TRUE s->state == 4480 [L1423] ret = __VERIFIER_nondet_int() [L1424] COND FALSE !(ret <= 0) [L1429] EXPR s->s3 [L1429] EXPR (s->s3)->tmp.new_cipher [L1429] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1429] l = ((s->s3)->tmp.new_cipher)->algorithms [L1430] EXPR s->s3 [L1430] EXPR (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1430] COND FALSE !((s->s3)->tmp.cert_req == 1) [L1433] s->state = 4512 [L1434] EXPR s->s3 [L1434] (s->s3)->change_cipher_spec = 0 [L1436] s->init_num = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=20487, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506: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=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1197] COND FALSE !(s->state == 4480) [L1200] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1200] COND FALSE !(s->state == 4481) [L1203] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1203] COND FALSE !(s->state == 4496) [L1206] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1206] COND FALSE !(s->state == 4497) [L1209] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1209] COND TRUE s->state == 4512 [L1452] ret = __VERIFIER_nondet_int() [L1453] COND FALSE !(ret <= 0) [L1458] s->state = 4528 [L1459] s->init_num = 0 [L1460] EXPR s->session [L1460] EXPR s->s3 [L1460] EXPR (s->s3)->tmp.new_cipher [L1460] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1461] EXPR s->s3 [L1461] EXPR (s->s3)->tmp.new_compression VAL [={1:0}, (s->s3)->tmp.new_compression={0:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1461] COND TRUE (unsigned long )(s->s3)->tmp.new_compression == (unsigned long )((void *)0) [L1462] EXPR s->session [L1462] (s->session)->compress_meth = 0 [L1466] tmp___7 = __VERIFIER_nondet_int() [L1467] COND FALSE !(! tmp___7) [L1473] tmp___8 = __VERIFIER_nondet_int() [L1474] COND FALSE !(! tmp___8) VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND TRUE blastFlag == 5 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=0, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1646] __VERIFIER_error() VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=0, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 32.1s OverallTime, 79 OverallIterations, 10 TraceHistogramMax, 17.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16894 SDtfs, 6526 SDslu, 23774 SDs, 0 SdLazy, 15020 SolverSat, 686 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5652 GetRequests, 5176 SyntacticMatches, 174 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 13 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 78 MinimizatonAttempts, 18056 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 14439 NumberOfCodeBlocks, 14439 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 16646 ConstructedInterpolants, 0 QuantifiedInterpolants, 7813773 SizeOfPredicates, 53 NumberOfNonLiveVariables, 11071 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 104 InterpolantComputations, 84 PerfectInterpolantSequences, 34958/35271 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-02 03:08:51,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:08:51,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:08:51,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:08:51,484 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:08:51,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:08:51,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:08:51,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:08:51,487 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:08:51,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:08:51,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:08:51,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:08:51,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:08:51,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:08:51,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:08:51,490 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:08:51,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:08:51,491 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:08:51,492 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:08:51,493 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:08:51,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:08:51,494 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:08:51,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:08:51,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:08:51,496 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:08:51,496 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:08:51,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:08:51,497 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:08:51,497 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:08:51,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:08:51,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:08:51,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:08:51,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:08:51,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:08:51,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:08:51,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:08:51,500 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 03:08:51,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:08:51,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:08:51,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 03:08:51,508 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 03:08:51,508 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 03:08:51,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 03:08:51,508 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 03:08:51,508 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 03:08:51,509 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 03:08:51,509 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 03:08:51,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:08:51,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:08:51,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:08:51,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:08:51,510 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 03:08:51,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 03:08:51,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:08:51,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 03:08:51,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 03:08:51,512 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 03:08:51,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 03:08:51,512 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 03:08:51,512 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 03:08:51,512 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_e8b359ac-a588-422d-8d72-c3bdf608e61a/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 -> 07be4c432baffc0b0315a344289242773ed6234f [2018-12-02 03:08:51,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:08:51,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:08:51,539 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:08:51,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:08:51,540 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:08:51,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-02 03:08:51,575 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/1c789a473/e61479157677491db1436f64916e4b51/FLAGdf9a665ce [2018-12-02 03:08:52,049 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:08:52,050 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-02 03:08:52,061 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/1c789a473/e61479157677491db1436f64916e4b51/FLAGdf9a665ce [2018-12-02 03:08:52,072 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8b359ac-a588-422d-8d72-c3bdf608e61a/bin-2019/utaipan/data/1c789a473/e61479157677491db1436f64916e4b51 [2018-12-02 03:08:52,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:08:52,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:08:52,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:08:52,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:08:52,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:08:52,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:52" (1/1) ... [2018-12-02 03:08:52,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c700c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:52, skipping insertion in model container [2018-12-02 03:08:52,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:52" (1/1) ... [2018-12-02 03:08:52,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:08:52,125 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:08:52,376 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:52,388 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:08:52,498 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:08:52,499 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-02 03:08:52,502 INFO L168 Benchmark]: Toolchain (without parser) took 427.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:52,504 INFO L168 Benchmark]: CDTParser took 0.12 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-02 03:08:52,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-02 03:08:52,506 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 425.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 40.5 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...