./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/s3_false-unreach-call.i --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_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/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 cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/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 cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ................................................................................................................................................................................. 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-09 19:10:22,482 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:10:22,483 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:10:22,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:10:22,492 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:10:22,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:10:22,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:10:22,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:10:22,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:10:22,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:10:22,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:10:22,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:10:22,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:10:22,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:10:22,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:10:22,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:10:22,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:10:22,502 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:10:22,503 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:10:22,504 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:10:22,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:10:22,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:10:22,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:10:22,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:10:22,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:10:22,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:10:22,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:10:22,509 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:10:22,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:10:22,510 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:10:22,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:10:22,511 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:10:22,511 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:10:22,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:10:22,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:10:22,512 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:10:22,512 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:10:22,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:10:22,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:10:22,523 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:10:22,523 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:10:22,523 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:10:22,523 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:10:22,524 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:10:22,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:10:22,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:10:22,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:10:22,525 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:10:22,526 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:10:22,527 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:10:22,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:10:22,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:10:22,527 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:10:22,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:10:22,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:10:22,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:10:22,528 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:10:22,528 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_faf20577-e89e-480a-b908-199945aa42e1/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 -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-12-09 19:10:22,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:10:22,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:10:22,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:10:22,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:10:22,556 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:10:22,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-12-09 19:10:22,589 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/9a87066df/a2179a3449e94f15bb3e968a45db4f68/FLAGd1f709a29 [2018-12-09 19:10:22,968 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:10:22,968 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-12-09 19:10:22,976 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/9a87066df/a2179a3449e94f15bb3e968a45db4f68/FLAGd1f709a29 [2018-12-09 19:10:23,325 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/9a87066df/a2179a3449e94f15bb3e968a45db4f68 [2018-12-09 19:10:23,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:10:23,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:10:23,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:23,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:10:23,342 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:10:23,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4b6ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23, skipping insertion in model container [2018-12-09 19:10:23,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:10:23,379 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:10:23,608 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:23,616 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:10:23,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:23,679 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:10:23,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23 WrapperNode [2018-12-09 19:10:23,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:23,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:23,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:10:23,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:10:23,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,697 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:10:23,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:10:23,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:10:23,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:10:23,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... [2018-12-09 19:10:23,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:10:23,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:10:23,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:10:23,750 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:10:23,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/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-09 19:10:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:10:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 19:10:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 19:10:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:10:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:10:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 19:10:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 19:10:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:10:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:10:24,012 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 19:10:24,012 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 19:10:24,374 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:10:24,374 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:10:24,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:24 BoogieIcfgContainer [2018-12-09 19:10:24,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:10:24,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:10:24,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:10:24,377 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:10:24,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:10:23" (1/3) ... [2018-12-09 19:10:24,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c28162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:24, skipping insertion in model container [2018-12-09 19:10:24,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:23" (2/3) ... [2018-12-09 19:10:24,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c28162e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:24, skipping insertion in model container [2018-12-09 19:10:24,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:24" (3/3) ... [2018-12-09 19:10:24,380 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-12-09 19:10:24,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:10:24,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 19:10:24,404 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 19:10:24,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:10:24,423 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:10:24,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:10:24,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:10:24,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:10:24,423 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:10:24,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:10:24,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:10:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-09 19:10:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 19:10:24,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:24,438 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-09 19:10:24,439 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:24,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-12-09 19:10:24,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:24,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:24,595 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-09 19:10:24,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:24,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:10:24,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:24,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:10:24,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:10:24,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:10:24,608 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-09 19:10:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:24,683 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-12-09 19:10:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:10:24,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 19:10:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:24,695 INFO L225 Difference]: With dead ends: 385 [2018-12-09 19:10:24,695 INFO L226 Difference]: Without dead ends: 223 [2018-12-09 19:10:24,698 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-09 19:10:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-09 19:10:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-09 19:10:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-09 19:10:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-12-09 19:10:24,740 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-12-09 19:10:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:24,740 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-12-09 19:10:24,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:10:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-12-09 19:10:24,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 19:10:24,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:24,742 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-09 19:10:24,743 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:24,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:24,743 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-12-09 19:10:24,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:24,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:24,821 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-09 19:10:24,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:24,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:10:24,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:24,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:10:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:10:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:10:24,823 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-12-09 19:10:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:24,865 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-12-09 19:10:24,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:10:24,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 19:10:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:24,866 INFO L225 Difference]: With dead ends: 432 [2018-12-09 19:10:24,867 INFO L226 Difference]: Without dead ends: 325 [2018-12-09 19:10:24,867 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-09 19:10:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-09 19:10:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-12-09 19:10:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-09 19:10:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-12-09 19:10:24,884 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-12-09 19:10:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:24,884 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-12-09 19:10:24,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:10:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-12-09 19:10:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:10:24,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:24,887 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-09 19:10:24,887 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:24,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-12-09 19:10:24,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:24,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:24,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:24,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:25,000 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-09 19:10:25,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:25,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:25,001 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:25,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:25,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:25,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:25,002 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-12-09 19:10:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:25,284 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-12-09 19:10:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:25,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 19:10:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:25,286 INFO L225 Difference]: With dead ends: 825 [2018-12-09 19:10:25,286 INFO L226 Difference]: Without dead ends: 513 [2018-12-09 19:10:25,287 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-09 19:10:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-09 19:10:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-12-09 19:10:25,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-09 19:10:25,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-12-09 19:10:25,306 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-12-09 19:10:25,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:25,306 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-12-09 19:10:25,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-12-09 19:10:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 19:10:25,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:25,309 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-09 19:10:25,309 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:25,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1956647801, now seen corresponding path program 1 times [2018-12-09 19:10:25,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:25,375 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-09 19:10:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:25,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:25,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:25,377 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-12-09 19:10:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:25,592 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-12-09 19:10:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:25,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 19:10:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:25,595 INFO L225 Difference]: With dead ends: 821 [2018-12-09 19:10:25,595 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 19:10:25,596 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-09 19:10:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 19:10:25,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-12-09 19:10:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-09 19:10:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-12-09 19:10:25,610 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-12-09 19:10:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:25,611 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-12-09 19:10:25,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-12-09 19:10:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 19:10:25,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:25,613 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-09 19:10:25,613 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:25,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:25,614 INFO L82 PathProgramCache]: Analyzing trace with hash -671506196, now seen corresponding path program 1 times [2018-12-09 19:10:25,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:25,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:25,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:25,668 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-09 19:10:25,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:25,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:25,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:25,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:25,670 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-12-09 19:10:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:25,918 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2018-12-09 19:10:25,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:25,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 19:10:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:25,920 INFO L225 Difference]: With dead ends: 949 [2018-12-09 19:10:25,920 INFO L226 Difference]: Without dead ends: 547 [2018-12-09 19:10:25,920 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-09 19:10:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-09 19:10:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2018-12-09 19:10:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 19:10:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-12-09 19:10:25,928 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-12-09 19:10:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:25,928 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-12-09 19:10:25,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-12-09 19:10:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:10:25,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:25,929 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:25,929 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:25,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash 653887364, now seen corresponding path program 1 times [2018-12-09 19:10:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:25,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:25,972 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-09 19:10:25,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:25,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:25,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:25,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:25,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:25,974 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-12-09 19:10:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:26,242 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2018-12-09 19:10:26,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:26,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 19:10:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:26,244 INFO L225 Difference]: With dead ends: 951 [2018-12-09 19:10:26,244 INFO L226 Difference]: Without dead ends: 547 [2018-12-09 19:10:26,245 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-09 19:10:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-12-09 19:10:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2018-12-09 19:10:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-09 19:10:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-12-09 19:10:26,252 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2018-12-09 19:10:26,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:26,253 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-12-09 19:10:26,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-12-09 19:10:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 19:10:26,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:26,253 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:26,254 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:26,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1208805305, now seen corresponding path program 1 times [2018-12-09 19:10:26,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:26,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:26,289 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-09 19:10:26,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:26,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:26,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:26,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:26,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:26,290 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-12-09 19:10:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:26,555 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2018-12-09 19:10:26,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:26,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-09 19:10:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:26,556 INFO L225 Difference]: With dead ends: 943 [2018-12-09 19:10:26,557 INFO L226 Difference]: Without dead ends: 537 [2018-12-09 19:10:26,557 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-09 19:10:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-09 19:10:26,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2018-12-09 19:10:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2018-12-09 19:10:26,565 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2018-12-09 19:10:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:26,565 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2018-12-09 19:10:26,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2018-12-09 19:10:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:26,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:26,566 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-09 19:10:26,566 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:26,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash -784316286, now seen corresponding path program 1 times [2018-12-09 19:10:26,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:26,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:26,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:26,620 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-09 19:10:26,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:26,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:26,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:26,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:26,621 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2018-12-09 19:10:26,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:26,862 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2018-12-09 19:10:26,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:26,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:26,864 INFO L225 Difference]: With dead ends: 943 [2018-12-09 19:10:26,865 INFO L226 Difference]: Without dead ends: 535 [2018-12-09 19:10:26,865 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-09 19:10:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-09 19:10:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-09 19:10:26,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2018-12-09 19:10:26,878 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2018-12-09 19:10:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:26,878 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2018-12-09 19:10:26,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2018-12-09 19:10:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:26,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:26,879 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-09 19:10:26,880 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:26,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -802971744, now seen corresponding path program 1 times [2018-12-09 19:10:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:26,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:26,934 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-09 19:10:26,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:26,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:26,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:26,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:26,935 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2018-12-09 19:10:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:27,182 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2018-12-09 19:10:27,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:27,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:27,185 INFO L225 Difference]: With dead ends: 943 [2018-12-09 19:10:27,185 INFO L226 Difference]: Without dead ends: 535 [2018-12-09 19:10:27,186 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-09 19:10:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-09 19:10:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-09 19:10:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2018-12-09 19:10:27,198 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2018-12-09 19:10:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2018-12-09 19:10:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2018-12-09 19:10:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:27,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:27,199 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-09 19:10:27,200 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1508472381, now seen corresponding path program 1 times [2018-12-09 19:10:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:27,245 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-09 19:10:27,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:27,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:27,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:27,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:27,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:27,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:27,246 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2018-12-09 19:10:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:27,469 INFO L93 Difference]: Finished difference Result 794 states and 1181 transitions. [2018-12-09 19:10:27,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:27,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:27,470 INFO L225 Difference]: With dead ends: 794 [2018-12-09 19:10:27,470 INFO L226 Difference]: Without dead ends: 535 [2018-12-09 19:10:27,471 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-09 19:10:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-09 19:10:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-09 19:10:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2018-12-09 19:10:27,478 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2018-12-09 19:10:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:27,478 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2018-12-09 19:10:27,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2018-12-09 19:10:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:27,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:27,479 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-09 19:10:27,479 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:27,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1665283844, now seen corresponding path program 1 times [2018-12-09 19:10:27,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:27,514 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-09 19:10:27,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:27,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:27,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:27,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:27,515 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2018-12-09 19:10:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:27,687 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2018-12-09 19:10:27,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:27,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:27,688 INFO L225 Difference]: With dead ends: 871 [2018-12-09 19:10:27,689 INFO L226 Difference]: Without dead ends: 463 [2018-12-09 19:10:27,689 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-09 19:10:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-09 19:10:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-09 19:10:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-12-09 19:10:27,696 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2018-12-09 19:10:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:27,696 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-12-09 19:10:27,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-12-09 19:10:27,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:27,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:27,697 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-09 19:10:27,697 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:27,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:27,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1646628386, now seen corresponding path program 1 times [2018-12-09 19:10:27,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:27,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:27,736 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-09 19:10:27,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:27,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:27,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:27,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:27,737 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-12-09 19:10:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:27,929 INFO L93 Difference]: Finished difference Result 871 states and 1292 transitions. [2018-12-09 19:10:27,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:27,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:27,930 INFO L225 Difference]: With dead ends: 871 [2018-12-09 19:10:27,930 INFO L226 Difference]: Without dead ends: 463 [2018-12-09 19:10:27,931 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-09 19:10:27,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-09 19:10:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-09 19:10:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2018-12-09 19:10:27,938 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2018-12-09 19:10:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:27,938 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2018-12-09 19:10:27,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2018-12-09 19:10:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 19:10:27,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:27,939 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-09 19:10:27,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:27,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:27,939 INFO L82 PathProgramCache]: Analyzing trace with hash 941127749, now seen corresponding path program 1 times [2018-12-09 19:10:27,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:27,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:27,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:27,984 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-09 19:10:27,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:27,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:27,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:27,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:27,984 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2018-12-09 19:10:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:28,147 INFO L93 Difference]: Finished difference Result 722 states and 1065 transitions. [2018-12-09 19:10:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:28,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 19:10:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:28,149 INFO L225 Difference]: With dead ends: 722 [2018-12-09 19:10:28,149 INFO L226 Difference]: Without dead ends: 463 [2018-12-09 19:10:28,149 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-09 19:10:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-09 19:10:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-09 19:10:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:28,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2018-12-09 19:10:28,156 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2018-12-09 19:10:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:28,157 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2018-12-09 19:10:28,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2018-12-09 19:10:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 19:10:28,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:28,158 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-09 19:10:28,158 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:28,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1290131619, now seen corresponding path program 1 times [2018-12-09 19:10:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:28,200 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-09 19:10:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:28,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:28,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:28,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:28,201 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2018-12-09 19:10:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:28,416 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2018-12-09 19:10:28,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 19:10:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:28,417 INFO L225 Difference]: With dead ends: 943 [2018-12-09 19:10:28,418 INFO L226 Difference]: Without dead ends: 535 [2018-12-09 19:10:28,418 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-09 19:10:28,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-09 19:10:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-12-09 19:10:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2018-12-09 19:10:28,426 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2018-12-09 19:10:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:28,426 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2018-12-09 19:10:28,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:28,426 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2018-12-09 19:10:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 19:10:28,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:28,427 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-09 19:10:28,427 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:28,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:28,428 INFO L82 PathProgramCache]: Analyzing trace with hash 765876928, now seen corresponding path program 1 times [2018-12-09 19:10:28,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:28,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:28,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:28,460 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-09 19:10:28,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:28,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:28,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:28,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:28,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:28,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:28,460 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2018-12-09 19:10:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:28,705 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2018-12-09 19:10:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:28,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 19:10:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:28,706 INFO L225 Difference]: With dead ends: 788 [2018-12-09 19:10:28,706 INFO L226 Difference]: Without dead ends: 529 [2018-12-09 19:10:28,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-09 19:10:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-09 19:10:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-09 19:10:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2018-12-09 19:10:28,713 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2018-12-09 19:10:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:28,713 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2018-12-09 19:10:28,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2018-12-09 19:10:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 19:10:28,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:28,714 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-09 19:10:28,714 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:28,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:28,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1633028379, now seen corresponding path program 1 times [2018-12-09 19:10:28,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:28,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:28,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:28,744 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-09 19:10:28,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:28,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:28,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:28,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:28,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:28,745 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2018-12-09 19:10:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:28,910 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2018-12-09 19:10:28,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:28,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 19:10:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:28,911 INFO L225 Difference]: With dead ends: 871 [2018-12-09 19:10:28,911 INFO L226 Difference]: Without dead ends: 463 [2018-12-09 19:10:28,911 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-09 19:10:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-12-09 19:10:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-12-09 19:10:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2018-12-09 19:10:28,922 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2018-12-09 19:10:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:28,922 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2018-12-09 19:10:28,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-12-09 19:10:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 19:10:28,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:28,923 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-09 19:10:28,924 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:28,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2018-12-09 19:10:28,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:28,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:28,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:28,964 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-09 19:10:28,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:28,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:28,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:28,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:28,964 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2018-12-09 19:10:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:29,112 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2018-12-09 19:10:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:29,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 19:10:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:29,113 INFO L225 Difference]: With dead ends: 716 [2018-12-09 19:10:29,113 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 19:10:29,113 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-09 19:10:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 19:10:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-09 19:10:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2018-12-09 19:10:29,120 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2018-12-09 19:10:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:29,120 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2018-12-09 19:10:29,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:29,120 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2018-12-09 19:10:29,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:10:29,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:29,121 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-09 19:10:29,121 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:29,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1753186171, now seen corresponding path program 1 times [2018-12-09 19:10:29,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:29,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:29,161 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-09 19:10:29,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:29,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:29,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:29,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:29,162 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2018-12-09 19:10:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:29,384 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2018-12-09 19:10:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:29,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 19:10:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:29,386 INFO L225 Difference]: With dead ends: 937 [2018-12-09 19:10:29,386 INFO L226 Difference]: Without dead ends: 529 [2018-12-09 19:10:29,386 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-09 19:10:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-09 19:10:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-12-09 19:10:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2018-12-09 19:10:29,393 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2018-12-09 19:10:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:29,393 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2018-12-09 19:10:29,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2018-12-09 19:10:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 19:10:29,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:29,394 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-09 19:10:29,394 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:29,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:29,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1329539449, now seen corresponding path program 1 times [2018-12-09 19:10:29,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:29,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:29,425 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-09 19:10:29,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:29,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:29,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:29,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:29,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:29,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:29,425 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2018-12-09 19:10:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:29,567 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2018-12-09 19:10:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:29,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 19:10:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:29,569 INFO L225 Difference]: With dead ends: 865 [2018-12-09 19:10:29,569 INFO L226 Difference]: Without dead ends: 457 [2018-12-09 19:10:29,569 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-09 19:10:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-09 19:10:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-09 19:10:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2018-12-09 19:10:29,576 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2018-12-09 19:10:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:29,576 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2018-12-09 19:10:29,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2018-12-09 19:10:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:10:29,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:29,577 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-09 19:10:29,577 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:29,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975710, now seen corresponding path program 1 times [2018-12-09 19:10:29,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:29,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:29,618 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-09 19:10:29,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:29,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:29,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:29,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:29,619 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2018-12-09 19:10:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:29,810 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2018-12-09 19:10:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:29,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 19:10:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:29,811 INFO L225 Difference]: With dead ends: 919 [2018-12-09 19:10:29,811 INFO L226 Difference]: Without dead ends: 511 [2018-12-09 19:10:29,811 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-09 19:10:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-09 19:10:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-09 19:10:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2018-12-09 19:10:29,822 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2018-12-09 19:10:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:29,823 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2018-12-09 19:10:29,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2018-12-09 19:10:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:10:29,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:29,824 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-09 19:10:29,824 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:29,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1134564595, now seen corresponding path program 1 times [2018-12-09 19:10:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:29,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:29,862 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-09 19:10:29,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:29,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:29,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:29,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:29,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:29,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:29,863 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2018-12-09 19:10:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,045 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2018-12-09 19:10:30,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:30,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 19:10:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,046 INFO L225 Difference]: With dead ends: 919 [2018-12-09 19:10:30,046 INFO L226 Difference]: Without dead ends: 511 [2018-12-09 19:10:30,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-09 19:10:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-09 19:10:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-12-09 19:10:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2018-12-09 19:10:30,053 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2018-12-09 19:10:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,053 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2018-12-09 19:10:30,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2018-12-09 19:10:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:10:30,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,054 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-09 19:10:30,054 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1220829216, now seen corresponding path program 1 times [2018-12-09 19:10:30,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,086 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-09 19:10:30,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:30,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:30,087 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2018-12-09 19:10:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,209 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2018-12-09 19:10:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:30,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 19:10:30,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,210 INFO L225 Difference]: With dead ends: 847 [2018-12-09 19:10:30,210 INFO L226 Difference]: Without dead ends: 439 [2018-12-09 19:10:30,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-09 19:10:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-09 19:10:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2018-12-09 19:10:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-09 19:10:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2018-12-09 19:10:30,217 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2018-12-09 19:10:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,217 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2018-12-09 19:10:30,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2018-12-09 19:10:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 19:10:30,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,218 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-09 19:10:30,218 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1382711089, now seen corresponding path program 1 times [2018-12-09 19:10:30,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,246 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-09 19:10:30,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:10:30,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:10:30,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:10:30,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:10:30,247 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2018-12-09 19:10:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,270 INFO L93 Difference]: Finished difference Result 831 states and 1204 transitions. [2018-12-09 19:10:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:10:30,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 19:10:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,272 INFO L225 Difference]: With dead ends: 831 [2018-12-09 19:10:30,272 INFO L226 Difference]: Without dead ends: 574 [2018-12-09 19:10:30,272 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-09 19:10:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-12-09 19:10:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-12-09 19:10:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-09 19:10:30,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2018-12-09 19:10:30,282 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2018-12-09 19:10:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,283 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2018-12-09 19:10:30,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:10:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2018-12-09 19:10:30,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 19:10:30,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,284 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-09 19:10:30,284 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1024261319, now seen corresponding path program 1 times [2018-12-09 19:10:30,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,306 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-09 19:10:30,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:10:30,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:10:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:10:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:10:30,307 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2018-12-09 19:10:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,344 INFO L93 Difference]: Finished difference Result 729 states and 1052 transitions. [2018-12-09 19:10:30,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:10:30,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-09 19:10:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,346 INFO L225 Difference]: With dead ends: 729 [2018-12-09 19:10:30,346 INFO L226 Difference]: Without dead ends: 727 [2018-12-09 19:10:30,346 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-09 19:10:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-12-09 19:10:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-12-09 19:10:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-12-09 19:10:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2018-12-09 19:10:30,355 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2018-12-09 19:10:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,355 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2018-12-09 19:10:30,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:10:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2018-12-09 19:10:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 19:10:30,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,356 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-09 19:10:30,356 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash 934069236, now seen corresponding path program 1 times [2018-12-09 19:10:30,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,390 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-09 19:10:30,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:10:30,391 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:10:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:10:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:10:30,391 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2018-12-09 19:10:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,423 INFO L93 Difference]: Finished difference Result 1287 states and 1862 transitions. [2018-12-09 19:10:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:10:30,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 19:10:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,425 INFO L225 Difference]: With dead ends: 1287 [2018-12-09 19:10:30,425 INFO L226 Difference]: Without dead ends: 724 [2018-12-09 19:10:30,426 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-09 19:10:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-12-09 19:10:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-12-09 19:10:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-09 19:10:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2018-12-09 19:10:30,441 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2018-12-09 19:10:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,441 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2018-12-09 19:10:30,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:10:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2018-12-09 19:10:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 19:10:30,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,442 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:30,443 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -148840977, now seen corresponding path program 1 times [2018-12-09 19:10:30,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,493 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-09 19:10:30,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:30,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:30,494 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2018-12-09 19:10:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,650 INFO L93 Difference]: Finished difference Result 1692 states and 2439 transitions. [2018-12-09 19:10:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:30,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-09 19:10:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,652 INFO L225 Difference]: With dead ends: 1692 [2018-12-09 19:10:30,652 INFO L226 Difference]: Without dead ends: 981 [2018-12-09 19:10:30,653 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-09 19:10:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-12-09 19:10:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2018-12-09 19:10:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-09 19:10:30,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2018-12-09 19:10:30,664 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2018-12-09 19:10:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,664 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2018-12-09 19:10:30,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2018-12-09 19:10:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 19:10:30,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,665 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:30,665 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1084285646, now seen corresponding path program 1 times [2018-12-09 19:10:30,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 19:10:30,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:30,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:30,700 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2018-12-09 19:10:30,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:30,864 INFO L93 Difference]: Finished difference Result 1807 states and 2639 transitions. [2018-12-09 19:10:30,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:30,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 19:10:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:30,866 INFO L225 Difference]: With dead ends: 1807 [2018-12-09 19:10:30,866 INFO L226 Difference]: Without dead ends: 976 [2018-12-09 19:10:30,867 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-09 19:10:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-12-09 19:10:30,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-12-09 19:10:30,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-09 19:10:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2018-12-09 19:10:30,878 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2018-12-09 19:10:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:30,878 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2018-12-09 19:10:30,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2018-12-09 19:10:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 19:10:30,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:30,879 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:30,879 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:30,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1832311600, now seen corresponding path program 1 times [2018-12-09 19:10:30,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:30,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 19:10:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:30,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:30,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:30,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:30,913 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2018-12-09 19:10:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:31,069 INFO L93 Difference]: Finished difference Result 1807 states and 2629 transitions. [2018-12-09 19:10:31,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:31,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 19:10:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:31,071 INFO L225 Difference]: With dead ends: 1807 [2018-12-09 19:10:31,071 INFO L226 Difference]: Without dead ends: 976 [2018-12-09 19:10:31,072 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-09 19:10:31,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-12-09 19:10:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-12-09 19:10:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-09 19:10:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2018-12-09 19:10:31,083 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2018-12-09 19:10:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:31,084 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2018-12-09 19:10:31,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2018-12-09 19:10:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 19:10:31,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:31,084 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:31,085 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:31,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1213590989, now seen corresponding path program 1 times [2018-12-09 19:10:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:31,122 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-09 19:10:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:31,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:31,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:31,123 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2018-12-09 19:10:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:31,272 INFO L93 Difference]: Finished difference Result 1638 states and 2411 transitions. [2018-12-09 19:10:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:31,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 19:10:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:31,274 INFO L225 Difference]: With dead ends: 1638 [2018-12-09 19:10:31,274 INFO L226 Difference]: Without dead ends: 982 [2018-12-09 19:10:31,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-09 19:10:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-12-09 19:10:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2018-12-09 19:10:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-09 19:10:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2018-12-09 19:10:31,287 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2018-12-09 19:10:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:31,293 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2018-12-09 19:10:31,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:31,293 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2018-12-09 19:10:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-09 19:10:31,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:31,294 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:31,294 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:31,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1233245309, now seen corresponding path program 1 times [2018-12-09 19:10:31,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 19:10:31,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:31,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:31,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:31,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:31,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:31,337 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2018-12-09 19:10:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:31,501 INFO L93 Difference]: Finished difference Result 1951 states and 2859 transitions. [2018-12-09 19:10:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:31,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-09 19:10:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:31,503 INFO L225 Difference]: With dead ends: 1951 [2018-12-09 19:10:31,503 INFO L226 Difference]: Without dead ends: 1048 [2018-12-09 19:10:31,504 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-09 19:10:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-12-09 19:10:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-12-09 19:10:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-09 19:10:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2018-12-09 19:10:31,516 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2018-12-09 19:10:31,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:31,516 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2018-12-09 19:10:31,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2018-12-09 19:10:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-09 19:10:31,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:31,517 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:31,517 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:31,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:31,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2124457781, now seen corresponding path program 1 times [2018-12-09 19:10:31,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 19:10:31,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:31,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:31,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:31,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:31,554 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2018-12-09 19:10:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:31,714 INFO L93 Difference]: Finished difference Result 1951 states and 2849 transitions. [2018-12-09 19:10:31,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:31,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-09 19:10:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:31,716 INFO L225 Difference]: With dead ends: 1951 [2018-12-09 19:10:31,717 INFO L226 Difference]: Without dead ends: 1048 [2018-12-09 19:10:31,718 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-09 19:10:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-12-09 19:10:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-12-09 19:10:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-09 19:10:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2018-12-09 19:10:31,739 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2018-12-09 19:10:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:31,739 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2018-12-09 19:10:31,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2018-12-09 19:10:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 19:10:31,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:31,740 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:31,740 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:31,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 805588424, now seen corresponding path program 1 times [2018-12-09 19:10:31,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 19:10:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:31,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:31,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:31,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:31,789 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2018-12-09 19:10:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:31,931 INFO L93 Difference]: Finished difference Result 1906 states and 2784 transitions. [2018-12-09 19:10:31,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:31,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-09 19:10:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:31,933 INFO L225 Difference]: With dead ends: 1906 [2018-12-09 19:10:31,933 INFO L226 Difference]: Without dead ends: 1003 [2018-12-09 19:10:31,934 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-09 19:10:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-12-09 19:10:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2018-12-09 19:10:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-09 19:10:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2018-12-09 19:10:31,947 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2018-12-09 19:10:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:31,947 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2018-12-09 19:10:31,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2018-12-09 19:10:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 19:10:31,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:31,948 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:31,948 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:31,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1158112039, now seen corresponding path program 1 times [2018-12-09 19:10:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:31,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:31,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-12-09 19:10:31,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:31,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:10:31,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:31,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:10:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:10:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:10:31,988 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2018-12-09 19:10:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:32,144 INFO L93 Difference]: Finished difference Result 2051 states and 3014 transitions. [2018-12-09 19:10:32,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:10:32,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-09 19:10:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:32,146 INFO L225 Difference]: With dead ends: 2051 [2018-12-09 19:10:32,146 INFO L226 Difference]: Without dead ends: 1148 [2018-12-09 19:10:32,147 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-09 19:10:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-12-09 19:10:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2018-12-09 19:10:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-12-09 19:10:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2018-12-09 19:10:32,161 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2018-12-09 19:10:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:32,161 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2018-12-09 19:10:32,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:10:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2018-12-09 19:10:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 19:10:32,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:32,162 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:32,162 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:32,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash -421436053, now seen corresponding path program 1 times [2018-12-09 19:10:32,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:32,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:32,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:10:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-12-09 19:10:32,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:10:32,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:10:32,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:10:32,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:10:32,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:10:32,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:10:32,251 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2018-12-09 19:10:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:10:32,398 INFO L93 Difference]: Finished difference Result 2043 states and 3056 transitions. [2018-12-09 19:10:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:10:32,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-12-09 19:10:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:10:32,400 INFO L225 Difference]: With dead ends: 2043 [2018-12-09 19:10:32,400 INFO L226 Difference]: Without dead ends: 1030 [2018-12-09 19:10:32,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:10:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-12-09 19:10:32,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2018-12-09 19:10:32,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-12-09 19:10:32,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2018-12-09 19:10:32,420 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2018-12-09 19:10:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:10:32,420 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2018-12-09 19:10:32,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:10:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2018-12-09 19:10:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 19:10:32,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:10:32,422 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:10:32,422 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:10:32,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:10:32,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-12-09 19:10:32,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:10:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:32,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:10:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:10:32,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:10:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:10:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:10:32,616 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:10:32,651 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 19:10:32,651 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 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-09 19:10:32,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:10:32 BoogieIcfgContainer [2018-12-09 19:10:32,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:10:32,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:10:32,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:10:32,688 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:10:32,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:24" (3/4) ... [2018-12-09 19:10:32,691 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 19:10:32,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:10:32,691 INFO L168 Benchmark]: Toolchain (without parser) took 9359.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:32,692 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:10:32,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:32,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:10:32,693 INFO L168 Benchmark]: Boogie Preprocessor took 47.06 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-09 19:10:32,693 INFO L168 Benchmark]: RCFGBuilder took 624.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:32,693 INFO L168 Benchmark]: TraceAbstraction took 8312.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:32,693 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:10:32,695 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 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 344.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.06 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 624.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 77.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8312.66 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20485 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: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20542, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20490:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={20498:0}, SSLv3_client_data={20490:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->info_callback={6:-5}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=12292, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->version=1, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->bbio={0:0}, s->wbio={0:1}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->hit=0, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:-5}, ((s->s3)->tmp.new_cipher)->algorithms=20524, (s->s3)->tmp.new_cipher={20541:0}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 8.2s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7566 SDtfs, 2657 SDslu, 9982 SDs, 0 SdLazy, 5228 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 68 SyntacticMatches, 45 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 612042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 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-09 19:10:33,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:10:33,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:10:33,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:10:33,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:10:33,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:10:33,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:10:33,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:10:33,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:10:33,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:10:33,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:10:33,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:10:33,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:10:33,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:10:33,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:10:33,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:10:33,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:10:33,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:10:33,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:10:33,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:10:33,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:10:33,998 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:10:33,999 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:10:34,000 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:10:34,000 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:10:34,000 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:10:34,001 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:10:34,001 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:10:34,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:10:34,002 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:10:34,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:10:34,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:10:34,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:10:34,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:10:34,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:10:34,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:10:34,003 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 19:10:34,010 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:10:34,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:10:34,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:10:34,011 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:10:34,011 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:10:34,011 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:10:34,011 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:10:34,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:10:34,012 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:10:34,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:10:34,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:10:34,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 19:10:34,014 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 19:10:34,014 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_faf20577-e89e-480a-b908-199945aa42e1/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 -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-12-09 19:10:34,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:10:34,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:10:34,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:10:34,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:10:34,041 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:10:34,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-12-09 19:10:34,075 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/456f3143d/c7f479f6150b4c16846a74269ea0b0c1/FLAGae3bcc721 [2018-12-09 19:10:34,565 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:10:34,565 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-12-09 19:10:34,573 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/456f3143d/c7f479f6150b4c16846a74269ea0b0c1/FLAGae3bcc721 [2018-12-09 19:10:34,581 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_faf20577-e89e-480a-b908-199945aa42e1/bin-2019/utaipan/data/456f3143d/c7f479f6150b4c16846a74269ea0b0c1 [2018-12-09 19:10:34,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:10:34,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:10:34,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:10:34,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:10:34,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:10:34,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:34" (1/1) ... [2018-12-09 19:10:34,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c56038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:34, skipping insertion in model container [2018-12-09 19:10:34,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:34" (1/1) ... [2018-12-09 19:10:34,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:10:34,619 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:10:34,826 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:34,839 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:10:34,930 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:10:34,931 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-09 19:10:34,933 INFO L168 Benchmark]: Toolchain (without parser) took 350.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:34,934 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-09 19:10:34,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:34,936 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 348.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -184.6 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...