./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07be4c432baffc0b0315a344289242773ed6234f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07be4c432baffc0b0315a344289242773ed6234f ............................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:33:34,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:33:34,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:33:34,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:33:34,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:33:34,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:33:34,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:33:34,636 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:33:34,637 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:33:34,638 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:33:34,638 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:33:34,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:33:34,639 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:33:34,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:33:34,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:33:34,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:33:34,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:33:34,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:33:34,645 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:33:34,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:33:34,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:33:34,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:33:34,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:33:34,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:33:34,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:33:34,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:33:34,651 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:33:34,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:33:34,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:33:34,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:33:34,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:33:34,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:33:34,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:33:34,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:33:34,654 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:33:34,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:33:34,655 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 01:33:34,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:33:34,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:33:34,664 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:33:34,664 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:33:34,664 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:33:34,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:33:34,664 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:33:34,664 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:33:34,665 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:33:34,665 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:33:34,665 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:33:34,665 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:33:34,665 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:33:34,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:33:34,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:33:34,667 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:33:34,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:33:34,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:33:34,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:33:34,668 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:33:34,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:33:34,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:33:34,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 01:33:34,668 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_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07be4c432baffc0b0315a344289242773ed6234f [2018-12-09 01:33:34,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:33:34,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:33:34,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:33:34,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:33:34,700 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:33:34,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-09 01:33:34,736 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/f0eacab58/c7d2416b46c34635b77ddf42ade5b84f/FLAG328e1eee6 [2018-12-09 01:33:35,132 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:33:35,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-09 01:33:35,141 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/f0eacab58/c7d2416b46c34635b77ddf42ade5b84f/FLAG328e1eee6 [2018-12-09 01:33:35,474 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/f0eacab58/c7d2416b46c34635b77ddf42ade5b84f [2018-12-09 01:33:35,478 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:33:35,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:33:35,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:33:35,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:33:35,487 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:33:35,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26bbbe89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35, skipping insertion in model container [2018-12-09 01:33:35,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:33:35,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:33:35,768 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:33:35,777 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:33:35,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:33:35,840 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:33:35,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35 WrapperNode [2018-12-09 01:33:35,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:33:35,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:33:35,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:33:35,842 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:33:35,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:33:35,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:33:35,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:33:35,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:33:35,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... [2018-12-09 01:33:35,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:33:35,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:33:35,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:33:35,909 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:33:35,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/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 01:33:35,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:33:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:33:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-09 01:33:35,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-09 01:33:35,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:33:35,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:33:36,105 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-09 01:33:36,105 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-09 01:33:36,478 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:33:36,478 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 01:33:36,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:33:36 BoogieIcfgContainer [2018-12-09 01:33:36,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:33:36,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:33:36,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:33:36,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:33:36,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:33:35" (1/3) ... [2018-12-09 01:33:36,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18621381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:33:36, skipping insertion in model container [2018-12-09 01:33:36,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:33:35" (2/3) ... [2018-12-09 01:33:36,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18621381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:33:36, skipping insertion in model container [2018-12-09 01:33:36,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:33:36" (3/3) ... [2018-12-09 01:33:36,483 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-09 01:33:36,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:33:36,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 01:33:36,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 01:33:36,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:33:36,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 01:33:36,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:33:36,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:33:36,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:33:36,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:33:36,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:33:36,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:33:36,535 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-12-09 01:33:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 01:33:36,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:36,540 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 01:33:36,541 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:36,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1641138201, now seen corresponding path program 1 times [2018-12-09 01:33:36,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:36,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:36,695 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 01:33:36,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:36,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:33:36,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:36,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:33:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:33:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:33:36,709 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-12-09 01:33:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:36,773 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-12-09 01:33:36,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:33:36,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 01:33:36,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:36,782 INFO L225 Difference]: With dead ends: 385 [2018-12-09 01:33:36,782 INFO L226 Difference]: Without dead ends: 223 [2018-12-09 01:33:36,784 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 01:33:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-09 01:33:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-09 01:33:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-09 01:33:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-12-09 01:33:36,819 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-12-09 01:33:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:36,819 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-12-09 01:33:36,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:33:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-12-09 01:33:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 01:33:36,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:36,821 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 01:33:36,821 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:36,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1873554158, now seen corresponding path program 1 times [2018-12-09 01:33:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:36,882 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 01:33:36,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:36,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:33:36,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:36,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:33:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:33:36,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:33:36,885 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-12-09 01:33:36,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:36,925 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-12-09 01:33:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:33:36,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-09 01:33:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:36,927 INFO L225 Difference]: With dead ends: 432 [2018-12-09 01:33:36,927 INFO L226 Difference]: Without dead ends: 325 [2018-12-09 01:33:36,929 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 01:33:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-09 01:33:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-12-09 01:33:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-09 01:33:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-12-09 01:33:36,946 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-12-09 01:33:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:36,946 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-12-09 01:33:36,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:33:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-12-09 01:33:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 01:33:36,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:36,948 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 01:33:36,948 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:36,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:36,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1280906889, now seen corresponding path program 1 times [2018-12-09 01:33:36,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:36,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:36,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:36,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:37,049 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 01:33:37,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:37,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:37,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:37,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:37,050 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-12-09 01:33:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:37,354 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-12-09 01:33:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:37,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 01:33:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:37,356 INFO L225 Difference]: With dead ends: 825 [2018-12-09 01:33:37,356 INFO L226 Difference]: Without dead ends: 513 [2018-12-09 01:33:37,357 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 01:33:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-09 01:33:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-12-09 01:33:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-09 01:33:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-12-09 01:33:37,368 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-12-09 01:33:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:37,368 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-12-09 01:33:37,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-12-09 01:33:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 01:33:37,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:37,370 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 01:33:37,370 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:37,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:37,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1146893383, now seen corresponding path program 1 times [2018-12-09 01:33:37,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:37,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:37,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:37,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:37,418 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 01:33:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:37,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:37,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:37,419 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-12-09 01:33:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:37,603 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-12-09 01:33:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:37,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 01:33:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:37,604 INFO L225 Difference]: With dead ends: 821 [2018-12-09 01:33:37,605 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 01:33:37,605 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 01:33:37,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 01:33:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-12-09 01:33:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-09 01:33:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-12-09 01:33:37,615 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-12-09 01:33:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:37,615 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-12-09 01:33:37,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-12-09 01:33:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 01:33:37,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:37,617 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 01:33:37,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:37,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1048989966, now seen corresponding path program 1 times [2018-12-09 01:33:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:37,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:37,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:37,666 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 01:33:37,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:37,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:37,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:37,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:37,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:37,668 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-12-09 01:33:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:37,980 INFO L93 Difference]: Finished difference Result 947 states and 1428 transitions. [2018-12-09 01:33:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:37,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-09 01:33:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:37,983 INFO L225 Difference]: With dead ends: 947 [2018-12-09 01:33:37,983 INFO L226 Difference]: Without dead ends: 545 [2018-12-09 01:33:37,984 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 01:33:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-12-09 01:33:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 417. [2018-12-09 01:33:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-12-09 01:33:37,996 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-12-09 01:33:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:37,996 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-12-09 01:33:37,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:37,997 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-12-09 01:33:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:37,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:37,998 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 01:33:37,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1142804125, now seen corresponding path program 1 times [2018-12-09 01:33:37,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:38,064 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 01:33:38,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:38,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:38,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:38,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:38,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:38,065 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-12-09 01:33:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:38,296 INFO L93 Difference]: Finished difference Result 947 states and 1426 transitions. [2018-12-09 01:33:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:38,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:38,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:38,298 INFO L225 Difference]: With dead ends: 947 [2018-12-09 01:33:38,298 INFO L226 Difference]: Without dead ends: 543 [2018-12-09 01:33:38,299 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 01:33:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-09 01:33:38,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-09 01:33:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 630 transitions. [2018-12-09 01:33:38,307 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 630 transitions. Word has length 78 [2018-12-09 01:33:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:38,308 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 630 transitions. [2018-12-09 01:33:38,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:38,308 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 630 transitions. [2018-12-09 01:33:38,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:38,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:38,309 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 01:33:38,309 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:38,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:38,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1161459583, now seen corresponding path program 1 times [2018-12-09 01:33:38,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:38,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:38,356 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 01:33:38,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:38,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:38,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:38,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:38,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:38,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:38,357 INFO L87 Difference]: Start difference. First operand 417 states and 630 transitions. Second operand 4 states. [2018-12-09 01:33:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:38,629 INFO L93 Difference]: Finished difference Result 947 states and 1422 transitions. [2018-12-09 01:33:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:38,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:38,631 INFO L225 Difference]: With dead ends: 947 [2018-12-09 01:33:38,631 INFO L226 Difference]: Without dead ends: 543 [2018-12-09 01:33:38,631 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 01:33:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-09 01:33:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-09 01:33:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 628 transitions. [2018-12-09 01:33:38,639 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 628 transitions. Word has length 78 [2018-12-09 01:33:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:38,639 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 628 transitions. [2018-12-09 01:33:38,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 628 transitions. [2018-12-09 01:33:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:38,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:38,640 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 01:33:38,640 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:38,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1866960220, now seen corresponding path program 1 times [2018-12-09 01:33:38,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:38,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:38,686 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 01:33:38,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:38,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:38,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:38,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:38,688 INFO L87 Difference]: Start difference. First operand 417 states and 628 transitions. Second operand 4 states. [2018-12-09 01:33:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:38,949 INFO L93 Difference]: Finished difference Result 800 states and 1194 transitions. [2018-12-09 01:33:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:38,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:38,951 INFO L225 Difference]: With dead ends: 800 [2018-12-09 01:33:38,951 INFO L226 Difference]: Without dead ends: 543 [2018-12-09 01:33:38,951 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 01:33:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-09 01:33:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-09 01:33:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 626 transitions. [2018-12-09 01:33:38,959 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 626 transitions. Word has length 78 [2018-12-09 01:33:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:38,959 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 626 transitions. [2018-12-09 01:33:38,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 626 transitions. [2018-12-09 01:33:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:38,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:38,960 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 01:33:38,960 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:38,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1306796005, now seen corresponding path program 1 times [2018-12-09 01:33:38,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:38,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:38,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:38,999 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 01:33:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:39,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:39,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:39,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:39,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:39,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:39,001 INFO L87 Difference]: Start difference. First operand 417 states and 626 transitions. Second operand 4 states. [2018-12-09 01:33:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:39,181 INFO L93 Difference]: Finished difference Result 863 states and 1288 transitions. [2018-12-09 01:33:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:39,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:39,183 INFO L225 Difference]: With dead ends: 863 [2018-12-09 01:33:39,183 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 01:33:39,184 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 01:33:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 01:33:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-09 01:33:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 624 transitions. [2018-12-09 01:33:39,196 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 624 transitions. Word has length 78 [2018-12-09 01:33:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:39,196 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 624 transitions. [2018-12-09 01:33:39,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 624 transitions. [2018-12-09 01:33:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:39,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:39,197 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 01:33:39,198 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:39,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1288140547, now seen corresponding path program 1 times [2018-12-09 01:33:39,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:39,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:39,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:39,247 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 01:33:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:39,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:39,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:39,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:39,248 INFO L87 Difference]: Start difference. First operand 417 states and 624 transitions. Second operand 4 states. [2018-12-09 01:33:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:39,432 INFO L93 Difference]: Finished difference Result 863 states and 1284 transitions. [2018-12-09 01:33:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:39,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:39,434 INFO L225 Difference]: With dead ends: 863 [2018-12-09 01:33:39,434 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 01:33:39,435 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 01:33:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 01:33:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-09 01:33:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 622 transitions. [2018-12-09 01:33:39,444 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 622 transitions. Word has length 78 [2018-12-09 01:33:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:39,444 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 622 transitions. [2018-12-09 01:33:39,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 622 transitions. [2018-12-09 01:33:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:33:39,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:39,445 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 01:33:39,445 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:39,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash 582639910, now seen corresponding path program 1 times [2018-12-09 01:33:39,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:39,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:39,488 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 01:33:39,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:39,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:39,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:39,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:39,490 INFO L87 Difference]: Start difference. First operand 417 states and 622 transitions. Second operand 4 states. [2018-12-09 01:33:39,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:39,674 INFO L93 Difference]: Finished difference Result 716 states and 1059 transitions. [2018-12-09 01:33:39,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:39,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-09 01:33:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:39,675 INFO L225 Difference]: With dead ends: 716 [2018-12-09 01:33:39,675 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 01:33:39,676 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 01:33:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 01:33:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-09 01:33:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2018-12-09 01:33:39,683 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 78 [2018-12-09 01:33:39,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:39,683 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2018-12-09 01:33:39,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:39,683 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2018-12-09 01:33:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:33:39,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:39,684 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 01:33:39,684 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:39,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:39,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1171941476, now seen corresponding path program 1 times [2018-12-09 01:33:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:39,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:39,722 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 01:33:39,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:39,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:39,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:39,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:39,723 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2018-12-09 01:33:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:39,975 INFO L93 Difference]: Finished difference Result 947 states and 1402 transitions. [2018-12-09 01:33:39,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:39,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 01:33:39,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:39,977 INFO L225 Difference]: With dead ends: 947 [2018-12-09 01:33:39,977 INFO L226 Difference]: Without dead ends: 543 [2018-12-09 01:33:39,978 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 01:33:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-09 01:33:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 417. [2018-12-09 01:33:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 618 transitions. [2018-12-09 01:33:39,985 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 618 transitions. Word has length 79 [2018-12-09 01:33:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:39,985 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 618 transitions. [2018-12-09 01:33:39,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 618 transitions. [2018-12-09 01:33:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:33:39,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:39,986 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 01:33:39,986 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:39,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash 884067071, now seen corresponding path program 1 times [2018-12-09 01:33:39,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:39,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:40,019 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 01:33:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:40,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:40,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:40,020 INFO L87 Difference]: Start difference. First operand 417 states and 618 transitions. Second operand 4 states. [2018-12-09 01:33:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:40,272 INFO L93 Difference]: Finished difference Result 794 states and 1172 transitions. [2018-12-09 01:33:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:40,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 01:33:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:40,273 INFO L225 Difference]: With dead ends: 794 [2018-12-09 01:33:40,273 INFO L226 Difference]: Without dead ends: 537 [2018-12-09 01:33:40,274 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 01:33:40,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-09 01:33:40,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2018-12-09 01:33:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 616 transitions. [2018-12-09 01:33:40,282 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 616 transitions. Word has length 79 [2018-12-09 01:33:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:40,282 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 616 transitions. [2018-12-09 01:33:40,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 616 transitions. [2018-12-09 01:33:40,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:33:40,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:40,283 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 01:33:40,283 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:40,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:40,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1751218522, now seen corresponding path program 1 times [2018-12-09 01:33:40,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:40,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:40,315 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 01:33:40,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:40,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:40,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:40,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:40,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:40,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:40,316 INFO L87 Difference]: Start difference. First operand 417 states and 616 transitions. Second operand 4 states. [2018-12-09 01:33:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:40,475 INFO L93 Difference]: Finished difference Result 863 states and 1268 transitions. [2018-12-09 01:33:40,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:40,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 01:33:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:40,477 INFO L225 Difference]: With dead ends: 863 [2018-12-09 01:33:40,477 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 01:33:40,478 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 01:33:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 01:33:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-09 01:33:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 614 transitions. [2018-12-09 01:33:40,490 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 614 transitions. Word has length 79 [2018-12-09 01:33:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:40,490 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 614 transitions. [2018-12-09 01:33:40,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 614 transitions. [2018-12-09 01:33:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:33:40,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:40,491 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 01:33:40,491 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:40,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash -487740227, now seen corresponding path program 1 times [2018-12-09 01:33:40,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:40,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:40,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:40,542 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 01:33:40,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:40,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:40,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:40,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:40,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:40,543 INFO L87 Difference]: Start difference. First operand 417 states and 614 transitions. Second operand 4 states. [2018-12-09 01:33:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:40,681 INFO L93 Difference]: Finished difference Result 710 states and 1040 transitions. [2018-12-09 01:33:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:40,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-09 01:33:40,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:40,682 INFO L225 Difference]: With dead ends: 710 [2018-12-09 01:33:40,682 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 01:33:40,683 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 01:33:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 01:33:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2018-12-09 01:33:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 612 transitions. [2018-12-09 01:33:40,691 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 612 transitions. Word has length 79 [2018-12-09 01:33:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:40,691 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 612 transitions. [2018-12-09 01:33:40,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 612 transitions. [2018-12-09 01:33:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:33:40,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:40,692 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 01:33:40,692 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:40,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 257119526, now seen corresponding path program 1 times [2018-12-09 01:33:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:40,723 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 01:33:40,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:40,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:40,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:40,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:40,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:40,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:40,724 INFO L87 Difference]: Start difference. First operand 417 states and 612 transitions. Second operand 4 states. [2018-12-09 01:33:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:40,968 INFO L93 Difference]: Finished difference Result 941 states and 1379 transitions. [2018-12-09 01:33:40,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:40,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 01:33:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:40,970 INFO L225 Difference]: With dead ends: 941 [2018-12-09 01:33:40,970 INFO L226 Difference]: Without dead ends: 537 [2018-12-09 01:33:40,971 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 01:33:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-09 01:33:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2018-12-09 01:33:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 610 transitions. [2018-12-09 01:33:40,978 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 610 transitions. Word has length 80 [2018-12-09 01:33:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:40,978 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 610 transitions. [2018-12-09 01:33:40,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 610 transitions. [2018-12-09 01:33:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:33:40,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:40,979 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 01:33:40,979 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:40,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash 680766248, now seen corresponding path program 1 times [2018-12-09 01:33:40,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:40,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:40,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:40,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:41,011 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 01:33:41,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:41,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:41,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:41,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:41,012 INFO L87 Difference]: Start difference. First operand 417 states and 610 transitions. Second operand 4 states. [2018-12-09 01:33:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:41,172 INFO L93 Difference]: Finished difference Result 857 states and 1249 transitions. [2018-12-09 01:33:41,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:41,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-09 01:33:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:41,173 INFO L225 Difference]: With dead ends: 857 [2018-12-09 01:33:41,173 INFO L226 Difference]: Without dead ends: 453 [2018-12-09 01:33:41,174 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 01:33:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-09 01:33:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 417. [2018-12-09 01:33:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 608 transitions. [2018-12-09 01:33:41,181 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 608 transitions. Word has length 80 [2018-12-09 01:33:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:41,181 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 608 transitions. [2018-12-09 01:33:41,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 608 transitions. [2018-12-09 01:33:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:33:41,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:41,182 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 01:33:41,182 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:41,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash -932629983, now seen corresponding path program 1 times [2018-12-09 01:33:41,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:41,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:41,215 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 01:33:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:41,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:41,216 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:41,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:41,216 INFO L87 Difference]: Start difference. First operand 417 states and 608 transitions. Second operand 4 states. [2018-12-09 01:33:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:41,452 INFO L93 Difference]: Finished difference Result 923 states and 1349 transitions. [2018-12-09 01:33:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:41,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 01:33:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:41,455 INFO L225 Difference]: With dead ends: 923 [2018-12-09 01:33:41,455 INFO L226 Difference]: Without dead ends: 519 [2018-12-09 01:33:41,456 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 01:33:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-09 01:33:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2018-12-09 01:33:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 606 transitions. [2018-12-09 01:33:41,470 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 606 transitions. Word has length 81 [2018-12-09 01:33:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:41,471 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 606 transitions. [2018-12-09 01:33:41,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 606 transitions. [2018-12-09 01:33:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:33:41,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:41,472 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 01:33:41,473 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:41,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:41,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1670910322, now seen corresponding path program 1 times [2018-12-09 01:33:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:41,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:41,522 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 01:33:41,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:41,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:41,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:41,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:41,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:41,523 INFO L87 Difference]: Start difference. First operand 417 states and 606 transitions. Second operand 4 states. [2018-12-09 01:33:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:41,759 INFO L93 Difference]: Finished difference Result 923 states and 1345 transitions. [2018-12-09 01:33:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:41,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 01:33:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:41,760 INFO L225 Difference]: With dead ends: 923 [2018-12-09 01:33:41,761 INFO L226 Difference]: Without dead ends: 519 [2018-12-09 01:33:41,761 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 01:33:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-09 01:33:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 417. [2018-12-09 01:33:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 604 transitions. [2018-12-09 01:33:41,771 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 604 transitions. Word has length 81 [2018-12-09 01:33:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:41,772 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 604 transitions. [2018-12-09 01:33:41,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:41,772 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 604 transitions. [2018-12-09 01:33:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:33:41,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:41,772 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 01:33:41,773 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:41,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:41,773 INFO L82 PathProgramCache]: Analyzing trace with hash -684483489, now seen corresponding path program 1 times [2018-12-09 01:33:41,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:41,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:41,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:41,802 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 01:33:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:41,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:41,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:41,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:41,803 INFO L87 Difference]: Start difference. First operand 417 states and 604 transitions. Second operand 4 states. [2018-12-09 01:33:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:41,929 INFO L93 Difference]: Finished difference Result 839 states and 1215 transitions. [2018-12-09 01:33:41,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:41,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-09 01:33:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:41,930 INFO L225 Difference]: With dead ends: 839 [2018-12-09 01:33:41,930 INFO L226 Difference]: Without dead ends: 435 [2018-12-09 01:33:41,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 01:33:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-09 01:33:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 417. [2018-12-09 01:33:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 01:33:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 602 transitions. [2018-12-09 01:33:41,938 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 602 transitions. Word has length 81 [2018-12-09 01:33:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:41,938 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 602 transitions. [2018-12-09 01:33:41,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 602 transitions. [2018-12-09 01:33:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 01:33:41,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:41,939 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 01:33:41,939 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:41,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:41,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1919056816, now seen corresponding path program 1 times [2018-12-09 01:33:41,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:41,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:41,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:41,965 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 01:33:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:41,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:33:41,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:41,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:33:41,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:33:41,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:33:41,966 INFO L87 Difference]: Start difference. First operand 417 states and 602 transitions. Second operand 3 states. [2018-12-09 01:33:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:41,988 INFO L93 Difference]: Finished difference Result 823 states and 1196 transitions. [2018-12-09 01:33:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:33:41,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 01:33:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:41,989 INFO L225 Difference]: With dead ends: 823 [2018-12-09 01:33:41,989 INFO L226 Difference]: Without dead ends: 568 [2018-12-09 01:33:41,990 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 01:33:41,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-12-09 01:33:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2018-12-09 01:33:41,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-09 01:33:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 821 transitions. [2018-12-09 01:33:41,998 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 821 transitions. Word has length 81 [2018-12-09 01:33:41,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:41,998 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 821 transitions. [2018-12-09 01:33:41,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:33:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 821 transitions. [2018-12-09 01:33:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 01:33:41,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:41,999 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 01:33:41,999 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:41,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash -318802554, now seen corresponding path program 1 times [2018-12-09 01:33:41,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,025 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 01:33:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:33:42,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:33:42,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:33:42,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:33:42,026 INFO L87 Difference]: Start difference. First operand 568 states and 821 transitions. Second operand 3 states. [2018-12-09 01:33:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:42,064 INFO L93 Difference]: Finished difference Result 1125 states and 1634 transitions. [2018-12-09 01:33:42,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:33:42,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-09 01:33:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:42,066 INFO L225 Difference]: With dead ends: 1125 [2018-12-09 01:33:42,066 INFO L226 Difference]: Without dead ends: 719 [2018-12-09 01:33:42,067 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 01:33:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-12-09 01:33:42,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2018-12-09 01:33:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-12-09 01:33:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1041 transitions. [2018-12-09 01:33:42,076 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1041 transitions. Word has length 83 [2018-12-09 01:33:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:42,077 INFO L480 AbstractCegarLoop]: Abstraction has 719 states and 1041 transitions. [2018-12-09 01:33:42,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:33:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1041 transitions. [2018-12-09 01:33:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:33:42,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:42,078 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 01:33:42,078 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:42,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1417041014, now seen corresponding path program 1 times [2018-12-09 01:33:42,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,104 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 01:33:42,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:33:42,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:33:42,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:33:42,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:33:42,105 INFO L87 Difference]: Start difference. First operand 719 states and 1041 transitions. Second operand 3 states. [2018-12-09 01:33:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:42,129 INFO L93 Difference]: Finished difference Result 872 states and 1264 transitions. [2018-12-09 01:33:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:33:42,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-09 01:33:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:42,131 INFO L225 Difference]: With dead ends: 872 [2018-12-09 01:33:42,131 INFO L226 Difference]: Without dead ends: 870 [2018-12-09 01:33:42,131 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 01:33:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2018-12-09 01:33:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2018-12-09 01:33:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-12-09 01:33:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1262 transitions. [2018-12-09 01:33:42,143 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1262 transitions. Word has length 104 [2018-12-09 01:33:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:42,143 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1262 transitions. [2018-12-09 01:33:42,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:33:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1262 transitions. [2018-12-09 01:33:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:33:42,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:42,144 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:42,144 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:42,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:42,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1855841249, now seen corresponding path program 1 times [2018-12-09 01:33:42,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 01:33:42,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:42,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:42,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:42,188 INFO L87 Difference]: Start difference. First operand 870 states and 1262 transitions. Second operand 4 states. [2018-12-09 01:33:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:42,411 INFO L93 Difference]: Finished difference Result 2038 states and 2970 transitions. [2018-12-09 01:33:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:42,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-09 01:33:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:42,413 INFO L225 Difference]: With dead ends: 2038 [2018-12-09 01:33:42,413 INFO L226 Difference]: Without dead ends: 1181 [2018-12-09 01:33:42,415 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 01:33:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-12-09 01:33:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1014. [2018-12-09 01:33:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-09 01:33:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1514 transitions. [2018-12-09 01:33:42,437 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1514 transitions. Word has length 130 [2018-12-09 01:33:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:42,438 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1514 transitions. [2018-12-09 01:33:42,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1514 transitions. [2018-12-09 01:33:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 01:33:42,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:42,440 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:42,440 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:42,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -430109825, now seen corresponding path program 1 times [2018-12-09 01:33:42,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:42,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:42,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:42,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:42,506 INFO L87 Difference]: Start difference. First operand 1014 states and 1514 transitions. Second operand 4 states. [2018-12-09 01:33:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:42,678 INFO L93 Difference]: Finished difference Result 2176 states and 3210 transitions. [2018-12-09 01:33:42,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:42,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 01:33:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:42,680 INFO L225 Difference]: With dead ends: 2176 [2018-12-09 01:33:42,680 INFO L226 Difference]: Without dead ends: 1175 [2018-12-09 01:33:42,681 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 01:33:42,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-12-09 01:33:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2018-12-09 01:33:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-09 01:33:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1508 transitions. [2018-12-09 01:33:42,695 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1508 transitions. Word has length 145 [2018-12-09 01:33:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:42,696 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1508 transitions. [2018-12-09 01:33:42,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1508 transitions. [2018-12-09 01:33:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 01:33:42,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:42,697 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:42,697 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:42,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2085512931, now seen corresponding path program 1 times [2018-12-09 01:33:42,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:42,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:42,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:42,735 INFO L87 Difference]: Start difference. First operand 1014 states and 1508 transitions. Second operand 4 states. [2018-12-09 01:33:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:42,903 INFO L93 Difference]: Finished difference Result 2176 states and 3198 transitions. [2018-12-09 01:33:42,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:42,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 01:33:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:42,905 INFO L225 Difference]: With dead ends: 2176 [2018-12-09 01:33:42,905 INFO L226 Difference]: Without dead ends: 1175 [2018-12-09 01:33:42,906 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 01:33:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-12-09 01:33:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1014. [2018-12-09 01:33:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2018-12-09 01:33:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1502 transitions. [2018-12-09 01:33:42,920 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1502 transitions. Word has length 145 [2018-12-09 01:33:42,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:42,920 INFO L480 AbstractCegarLoop]: Abstraction has 1014 states and 1502 transitions. [2018-12-09 01:33:42,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:42,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1502 transitions. [2018-12-09 01:33:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 01:33:42,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:42,922 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:42,922 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:42,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash -561427072, now seen corresponding path program 1 times [2018-12-09 01:33:42,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:42,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:42,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 01:33:42,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:42,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:42,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:42,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:42,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:42,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:42,961 INFO L87 Difference]: Start difference. First operand 1014 states and 1502 transitions. Second operand 4 states. [2018-12-09 01:33:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:43,111 INFO L93 Difference]: Finished difference Result 2015 states and 2994 transitions. [2018-12-09 01:33:43,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:43,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-09 01:33:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:43,113 INFO L225 Difference]: With dead ends: 2015 [2018-12-09 01:33:43,114 INFO L226 Difference]: Without dead ends: 1187 [2018-12-09 01:33:43,114 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 01:33:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-12-09 01:33:43,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1104. [2018-12-09 01:33:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-09 01:33:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1652 transitions. [2018-12-09 01:33:43,127 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1652 transitions. Word has length 145 [2018-12-09 01:33:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:43,128 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1652 transitions. [2018-12-09 01:33:43,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1652 transitions. [2018-12-09 01:33:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:33:43,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:43,129 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:43,129 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:43,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1284546930, now seen corresponding path program 1 times [2018-12-09 01:33:43,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:43,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:43,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:43,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:43,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:43,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:43,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:43,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:43,176 INFO L87 Difference]: Start difference. First operand 1104 states and 1652 transitions. Second operand 4 states. [2018-12-09 01:33:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:43,336 INFO L93 Difference]: Finished difference Result 2356 states and 3486 transitions. [2018-12-09 01:33:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:43,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-09 01:33:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:43,338 INFO L225 Difference]: With dead ends: 2356 [2018-12-09 01:33:43,338 INFO L226 Difference]: Without dead ends: 1265 [2018-12-09 01:33:43,339 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 01:33:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-12-09 01:33:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2018-12-09 01:33:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-09 01:33:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1646 transitions. [2018-12-09 01:33:43,358 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1646 transitions. Word has length 146 [2018-12-09 01:33:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:43,359 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1646 transitions. [2018-12-09 01:33:43,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1646 transitions. [2018-12-09 01:33:43,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 01:33:43,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:43,360 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:43,360 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:43,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:43,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1534513346, now seen corresponding path program 1 times [2018-12-09 01:33:43,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:43,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:43,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:43,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:43,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:43,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:43,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:43,408 INFO L87 Difference]: Start difference. First operand 1104 states and 1646 transitions. Second operand 4 states. [2018-12-09 01:33:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:43,587 INFO L93 Difference]: Finished difference Result 2356 states and 3474 transitions. [2018-12-09 01:33:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:43,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2018-12-09 01:33:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:43,589 INFO L225 Difference]: With dead ends: 2356 [2018-12-09 01:33:43,589 INFO L226 Difference]: Without dead ends: 1265 [2018-12-09 01:33:43,590 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 01:33:43,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2018-12-09 01:33:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1104. [2018-12-09 01:33:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-09 01:33:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1640 transitions. [2018-12-09 01:33:43,607 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1640 transitions. Word has length 147 [2018-12-09 01:33:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:43,607 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1640 transitions. [2018-12-09 01:33:43,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1640 transitions. [2018-12-09 01:33:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 01:33:43,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:43,608 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:43,608 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:43,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -449136521, now seen corresponding path program 1 times [2018-12-09 01:33:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:43,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:43,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:43,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:43,650 INFO L87 Difference]: Start difference. First operand 1104 states and 1640 transitions. Second operand 4 states. [2018-12-09 01:33:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:43,794 INFO L93 Difference]: Finished difference Result 2302 states and 3396 transitions. [2018-12-09 01:33:43,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:43,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-09 01:33:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:43,797 INFO L225 Difference]: With dead ends: 2302 [2018-12-09 01:33:43,797 INFO L226 Difference]: Without dead ends: 1211 [2018-12-09 01:33:43,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:33:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-12-09 01:33:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2018-12-09 01:33:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-09 01:33:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1634 transitions. [2018-12-09 01:33:43,812 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1634 transitions. Word has length 148 [2018-12-09 01:33:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:43,813 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1634 transitions. [2018-12-09 01:33:43,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1634 transitions. [2018-12-09 01:33:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 01:33:43,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:43,814 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:43,814 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:43,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1587006100, now seen corresponding path program 1 times [2018-12-09 01:33:43,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:43,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 01:33:43,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:43,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:43,883 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-09 01:33:43,884 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:43,907 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:43,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:44,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:44,334 INFO L272 AbstractInterpreter]: Visited 65 different actions 227 times. Merged at 39 different actions 136 times. Never widened. Performed 1725 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1725 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 15 different actions. Largest state had 100 variables. [2018-12-09 01:33:44,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:44,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:44,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:44,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:44,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:44,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:44,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:44,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:44,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:44,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:44,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:44,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:44,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:44,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:44,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:44,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:44,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:44,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:44,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:44,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:44,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 01:33:44,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:44,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 183 proven. 8 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-12-09 01:33:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:44,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-09 01:33:44,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:44,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:33:44,619 INFO L87 Difference]: Start difference. First operand 1104 states and 1634 transitions. Second operand 4 states. [2018-12-09 01:33:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:44,812 INFO L93 Difference]: Finished difference Result 2302 states and 3384 transitions. [2018-12-09 01:33:44,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:44,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-09 01:33:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:44,815 INFO L225 Difference]: With dead ends: 2302 [2018-12-09 01:33:44,815 INFO L226 Difference]: Without dead ends: 1211 [2018-12-09 01:33:44,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:33:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2018-12-09 01:33:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1104. [2018-12-09 01:33:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2018-12-09 01:33:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1628 transitions. [2018-12-09 01:33:44,840 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1628 transitions. Word has length 148 [2018-12-09 01:33:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:44,840 INFO L480 AbstractCegarLoop]: Abstraction has 1104 states and 1628 transitions. [2018-12-09 01:33:44,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1628 transitions. [2018-12-09 01:33:44,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 01:33:44,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:44,842 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:44,843 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:44,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2094586744, now seen corresponding path program 1 times [2018-12-09 01:33:44,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:44,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:44,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:44,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-09 01:33:44,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:44,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:44,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:44,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:44,892 INFO L87 Difference]: Start difference. First operand 1104 states and 1628 transitions. Second operand 4 states. [2018-12-09 01:33:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:45,064 INFO L93 Difference]: Finished difference Result 2474 states and 3658 transitions. [2018-12-09 01:33:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:45,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-09 01:33:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:45,066 INFO L225 Difference]: With dead ends: 2474 [2018-12-09 01:33:45,067 INFO L226 Difference]: Without dead ends: 1383 [2018-12-09 01:33:45,068 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 01:33:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-12-09 01:33:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1236. [2018-12-09 01:33:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-12-09 01:33:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1856 transitions. [2018-12-09 01:33:45,088 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1856 transitions. Word has length 148 [2018-12-09 01:33:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:45,089 INFO L480 AbstractCegarLoop]: Abstraction has 1236 states and 1856 transitions. [2018-12-09 01:33:45,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1856 transitions. [2018-12-09 01:33:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:33:45,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:45,091 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:45,091 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:45,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 544458815, now seen corresponding path program 1 times [2018-12-09 01:33:45,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:45,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:45,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 201 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-09 01:33:45,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:45,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:45,177 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-12-09 01:33:45,177 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:45,179 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:45,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:45,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:45,437 INFO L272 AbstractInterpreter]: Visited 66 different actions 232 times. Merged at 39 different actions 136 times. Never widened. Performed 1741 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1741 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 16 different actions. Largest state had 100 variables. [2018-12-09 01:33:45,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:45,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:45,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:45,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:45,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:45,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:45,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:45,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:45,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:45,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:45,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:45,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:45,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:45,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:45,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:45,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:45,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:45,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-09 01:33:45,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:45,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:45,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-09 01:33:45,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:45,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 187 proven. 7 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-09 01:33:45,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:45,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 7] total 12 [2018-12-09 01:33:45,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:45,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:33:45,654 INFO L87 Difference]: Start difference. First operand 1236 states and 1856 transitions. Second operand 4 states. [2018-12-09 01:33:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:45,820 INFO L93 Difference]: Finished difference Result 2544 states and 3797 transitions. [2018-12-09 01:33:45,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:45,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-09 01:33:45,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:45,823 INFO L225 Difference]: With dead ends: 2544 [2018-12-09 01:33:45,823 INFO L226 Difference]: Without dead ends: 1321 [2018-12-09 01:33:45,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 292 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:33:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2018-12-09 01:33:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1236. [2018-12-09 01:33:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1236 states. [2018-12-09 01:33:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1850 transitions. [2018-12-09 01:33:45,845 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1850 transitions. Word has length 149 [2018-12-09 01:33:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:45,845 INFO L480 AbstractCegarLoop]: Abstraction has 1236 states and 1850 transitions. [2018-12-09 01:33:45,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1850 transitions. [2018-12-09 01:33:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:33:45,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:45,847 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:45,847 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:45,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1664061798, now seen corresponding path program 1 times [2018-12-09 01:33:45,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:45,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:45,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:45,899 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:45,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:45,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:45,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:45,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:45,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:45,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:45,900 INFO L87 Difference]: Start difference. First operand 1236 states and 1850 transitions. Second operand 4 states. [2018-12-09 01:33:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:46,151 INFO L93 Difference]: Finished difference Result 3016 states and 4520 transitions. [2018-12-09 01:33:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:46,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 01:33:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:46,155 INFO L225 Difference]: With dead ends: 3016 [2018-12-09 01:33:46,155 INFO L226 Difference]: Without dead ends: 1793 [2018-12-09 01:33:46,157 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 01:33:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-12-09 01:33:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1386. [2018-12-09 01:33:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2018-12-09 01:33:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2108 transitions. [2018-12-09 01:33:46,180 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2108 transitions. Word has length 152 [2018-12-09 01:33:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:46,181 INFO L480 AbstractCegarLoop]: Abstraction has 1386 states and 2108 transitions. [2018-12-09 01:33:46,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2108 transitions. [2018-12-09 01:33:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:33:46,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:46,183 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:46,183 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:46,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1798075304, now seen corresponding path program 1 times [2018-12-09 01:33:46,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:46,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:46,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:46,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:46,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:46,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:46,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:46,240 INFO L87 Difference]: Start difference. First operand 1386 states and 2108 transitions. Second operand 4 states. [2018-12-09 01:33:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:46,509 INFO L93 Difference]: Finished difference Result 3310 states and 5030 transitions. [2018-12-09 01:33:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:46,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-09 01:33:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:46,514 INFO L225 Difference]: With dead ends: 3310 [2018-12-09 01:33:46,514 INFO L226 Difference]: Without dead ends: 1937 [2018-12-09 01:33:46,516 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 01:33:46,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-12-09 01:33:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1380. [2018-12-09 01:33:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2018-12-09 01:33:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2102 transitions. [2018-12-09 01:33:46,541 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2102 transitions. Word has length 152 [2018-12-09 01:33:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:46,541 INFO L480 AbstractCegarLoop]: Abstraction has 1380 states and 2102 transitions. [2018-12-09 01:33:46,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2102 transitions. [2018-12-09 01:33:46,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 01:33:46,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:46,542 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:46,542 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:46,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:46,543 INFO L82 PathProgramCache]: Analyzing trace with hash -50726115, now seen corresponding path program 1 times [2018-12-09 01:33:46,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:46,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:46,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:46,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:46,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:46,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:46,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:46,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:46,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:46,590 INFO L87 Difference]: Start difference. First operand 1380 states and 2102 transitions. Second operand 4 states. [2018-12-09 01:33:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:46,847 INFO L93 Difference]: Finished difference Result 3284 states and 4998 transitions. [2018-12-09 01:33:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:46,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 01:33:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:46,850 INFO L225 Difference]: With dead ends: 3284 [2018-12-09 01:33:46,850 INFO L226 Difference]: Without dead ends: 1917 [2018-12-09 01:33:46,852 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 01:33:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-12-09 01:33:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1511. [2018-12-09 01:33:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2018-12-09 01:33:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2326 transitions. [2018-12-09 01:33:46,877 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2326 transitions. Word has length 153 [2018-12-09 01:33:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:46,878 INFO L480 AbstractCegarLoop]: Abstraction has 1511 states and 2326 transitions. [2018-12-09 01:33:46,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2326 transitions. [2018-12-09 01:33:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-09 01:33:46,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:46,880 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:46,880 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:46,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:46,880 INFO L82 PathProgramCache]: Analyzing trace with hash 89822495, now seen corresponding path program 1 times [2018-12-09 01:33:46,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:46,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:46,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:46,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:46,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:46,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:46,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:46,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:46,938 INFO L87 Difference]: Start difference. First operand 1511 states and 2326 transitions. Second operand 4 states. [2018-12-09 01:33:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:47,210 INFO L93 Difference]: Finished difference Result 3396 states and 5188 transitions. [2018-12-09 01:33:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:47,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-09 01:33:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:47,213 INFO L225 Difference]: With dead ends: 3396 [2018-12-09 01:33:47,213 INFO L226 Difference]: Without dead ends: 1898 [2018-12-09 01:33:47,214 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 01:33:47,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-09 01:33:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1361. [2018-12-09 01:33:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-09 01:33:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2068 transitions. [2018-12-09 01:33:47,238 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2068 transitions. Word has length 153 [2018-12-09 01:33:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:47,238 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2068 transitions. [2018-12-09 01:33:47,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2068 transitions. [2018-12-09 01:33:47,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 01:33:47,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:47,240 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:47,240 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:47,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:47,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1384147662, now seen corresponding path program 1 times [2018-12-09 01:33:47,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:47,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:47,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:47,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:47,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:47,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:47,288 INFO L87 Difference]: Start difference. First operand 1361 states and 2068 transitions. Second operand 4 states. [2018-12-09 01:33:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:47,507 INFO L93 Difference]: Finished difference Result 3240 states and 4918 transitions. [2018-12-09 01:33:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:47,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 01:33:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:47,510 INFO L225 Difference]: With dead ends: 3240 [2018-12-09 01:33:47,510 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:47,511 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 01:33:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1433. [2018-12-09 01:33:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-09 01:33:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2170 transitions. [2018-12-09 01:33:47,537 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2170 transitions. Word has length 167 [2018-12-09 01:33:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:47,537 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2170 transitions. [2018-12-09 01:33:47,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2170 transitions. [2018-12-09 01:33:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 01:33:47,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:47,538 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:47,539 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:47,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1402803120, now seen corresponding path program 1 times [2018-12-09 01:33:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:47,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:47,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:47,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:47,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:47,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:47,587 INFO L87 Difference]: Start difference. First operand 1433 states and 2170 transitions. Second operand 4 states. [2018-12-09 01:33:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:47,824 INFO L93 Difference]: Finished difference Result 3312 states and 5014 transitions. [2018-12-09 01:33:47,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:47,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 01:33:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:47,826 INFO L225 Difference]: With dead ends: 3312 [2018-12-09 01:33:47,826 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:47,827 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 01:33:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1439. [2018-12-09 01:33:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-09 01:33:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2176 transitions. [2018-12-09 01:33:47,854 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2176 transitions. Word has length 167 [2018-12-09 01:33:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:47,854 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2176 transitions. [2018-12-09 01:33:47,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:47,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2176 transitions. [2018-12-09 01:33:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 01:33:47,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:47,855 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:47,855 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:47,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1065452468, now seen corresponding path program 1 times [2018-12-09 01:33:47,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:47,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:47,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:47,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:47,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:47,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:47,911 INFO L87 Difference]: Start difference. First operand 1439 states and 2176 transitions. Second operand 4 states. [2018-12-09 01:33:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:48,154 INFO L93 Difference]: Finished difference Result 3318 states and 5014 transitions. [2018-12-09 01:33:48,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:48,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 01:33:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:48,157 INFO L225 Difference]: With dead ends: 3318 [2018-12-09 01:33:48,157 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:48,159 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 01:33:48,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1439. [2018-12-09 01:33:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1439 states. [2018-12-09 01:33:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2170 transitions. [2018-12-09 01:33:48,198 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2170 transitions. Word has length 167 [2018-12-09 01:33:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:48,198 INFO L480 AbstractCegarLoop]: Abstraction has 1439 states and 2170 transitions. [2018-12-09 01:33:48,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2170 transitions. [2018-12-09 01:33:48,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-09 01:33:48,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:48,200 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:48,200 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:48,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:48,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1046797010, now seen corresponding path program 1 times [2018-12-09 01:33:48,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:48,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:48,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:48,256 INFO L87 Difference]: Start difference. First operand 1439 states and 2170 transitions. Second operand 4 states. [2018-12-09 01:33:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:48,508 INFO L93 Difference]: Finished difference Result 3318 states and 5002 transitions. [2018-12-09 01:33:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:48,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-09 01:33:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:48,511 INFO L225 Difference]: With dead ends: 3318 [2018-12-09 01:33:48,511 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:48,512 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 01:33:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-09 01:33:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-09 01:33:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2056 transitions. [2018-12-09 01:33:48,540 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2056 transitions. Word has length 167 [2018-12-09 01:33:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:48,540 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2056 transitions. [2018-12-09 01:33:48,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2056 transitions. [2018-12-09 01:33:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 01:33:48,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:48,542 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:48,542 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:48,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash -63656531, now seen corresponding path program 1 times [2018-12-09 01:33:48,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:48,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:48,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:48,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:48,599 INFO L87 Difference]: Start difference. First operand 1361 states and 2056 transitions. Second operand 4 states. [2018-12-09 01:33:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:48,836 INFO L93 Difference]: Finished difference Result 3240 states and 4882 transitions. [2018-12-09 01:33:48,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:48,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-09 01:33:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:48,837 INFO L225 Difference]: With dead ends: 3240 [2018-12-09 01:33:48,837 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:48,838 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 01:33:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1445. [2018-12-09 01:33:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-12-09 01:33:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2170 transitions. [2018-12-09 01:33:48,867 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2170 transitions. Word has length 168 [2018-12-09 01:33:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:48,867 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 2170 transitions. [2018-12-09 01:33:48,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2170 transitions. [2018-12-09 01:33:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 01:33:48,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:48,868 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:48,868 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:48,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1435463829, now seen corresponding path program 1 times [2018-12-09 01:33:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:48,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:48,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:48,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:48,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:48,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:48,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:48,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:48,925 INFO L87 Difference]: Start difference. First operand 1445 states and 2170 transitions. Second operand 4 states. [2018-12-09 01:33:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:49,288 INFO L93 Difference]: Finished difference Result 3324 states and 4990 transitions. [2018-12-09 01:33:49,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:49,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-09 01:33:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:49,290 INFO L225 Difference]: With dead ends: 3324 [2018-12-09 01:33:49,290 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:49,292 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 01:33:49,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-09 01:33:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-09 01:33:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2050 transitions. [2018-12-09 01:33:49,322 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2050 transitions. Word has length 168 [2018-12-09 01:33:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:49,322 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2050 transitions. [2018-12-09 01:33:49,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2050 transitions. [2018-12-09 01:33:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-09 01:33:49,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:49,323 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:49,323 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:49,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 254214453, now seen corresponding path program 1 times [2018-12-09 01:33:49,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:49,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:49,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:49,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:49,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:49,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:49,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:49,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:49,369 INFO L87 Difference]: Start difference. First operand 1361 states and 2050 transitions. Second operand 4 states. [2018-12-09 01:33:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:49,683 INFO L93 Difference]: Finished difference Result 3240 states and 4864 transitions. [2018-12-09 01:33:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:49,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-09 01:33:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:49,685 INFO L225 Difference]: With dead ends: 3240 [2018-12-09 01:33:49,685 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:49,686 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 01:33:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1451. [2018-12-09 01:33:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-12-09 01:33:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2170 transitions. [2018-12-09 01:33:49,718 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2170 transitions. Word has length 169 [2018-12-09 01:33:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:49,718 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 2170 transitions. [2018-12-09 01:33:49,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2170 transitions. [2018-12-09 01:33:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-09 01:33:49,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:49,720 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:49,720 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:49,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash 677861175, now seen corresponding path program 1 times [2018-12-09 01:33:49,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:49,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:49,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:49,760 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:49,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:49,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:49,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:49,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:49,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:49,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:49,761 INFO L87 Difference]: Start difference. First operand 1451 states and 2170 transitions. Second operand 4 states. [2018-12-09 01:33:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:50,001 INFO L93 Difference]: Finished difference Result 3330 states and 4978 transitions. [2018-12-09 01:33:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:50,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-12-09 01:33:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:50,003 INFO L225 Difference]: With dead ends: 3330 [2018-12-09 01:33:50,003 INFO L226 Difference]: Without dead ends: 1892 [2018-12-09 01:33:50,004 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 01:33:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2018-12-09 01:33:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1361. [2018-12-09 01:33:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-09 01:33:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2044 transitions. [2018-12-09 01:33:50,035 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2044 transitions. Word has length 169 [2018-12-09 01:33:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:50,035 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2044 transitions. [2018-12-09 01:33:50,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2044 transitions. [2018-12-09 01:33:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:33:50,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:50,036 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:50,036 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:50,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1022687246, now seen corresponding path program 1 times [2018-12-09 01:33:50,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:50,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:50,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:50,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:50,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:50,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:50,098 INFO L87 Difference]: Start difference. First operand 1361 states and 2044 transitions. Second operand 4 states. [2018-12-09 01:33:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:50,322 INFO L93 Difference]: Finished difference Result 3186 states and 4780 transitions. [2018-12-09 01:33:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:50,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-09 01:33:50,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:50,323 INFO L225 Difference]: With dead ends: 3186 [2018-12-09 01:33:50,323 INFO L226 Difference]: Without dead ends: 1838 [2018-12-09 01:33:50,324 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 01:33:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-09 01:33:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1457. [2018-12-09 01:33:50,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-12-09 01:33:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2170 transitions. [2018-12-09 01:33:50,359 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2170 transitions. Word has length 170 [2018-12-09 01:33:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:50,359 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 2170 transitions. [2018-12-09 01:33:50,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2170 transitions. [2018-12-09 01:33:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:33:50,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:50,360 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:50,360 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:50,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:50,360 INFO L82 PathProgramCache]: Analyzing trace with hash -774540752, now seen corresponding path program 1 times [2018-12-09 01:33:50,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:50,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:50,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:50,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:50,416 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:50,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:50,417 INFO L87 Difference]: Start difference. First operand 1457 states and 2170 transitions. Second operand 4 states. [2018-12-09 01:33:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:50,663 INFO L93 Difference]: Finished difference Result 3282 states and 4900 transitions. [2018-12-09 01:33:50,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:50,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-12-09 01:33:50,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:50,675 INFO L225 Difference]: With dead ends: 3282 [2018-12-09 01:33:50,675 INFO L226 Difference]: Without dead ends: 1838 [2018-12-09 01:33:50,676 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 01:33:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-09 01:33:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1361. [2018-12-09 01:33:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2018-12-09 01:33:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 2038 transitions. [2018-12-09 01:33:50,708 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 2038 transitions. Word has length 170 [2018-12-09 01:33:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:50,708 INFO L480 AbstractCegarLoop]: Abstraction has 1361 states and 2038 transitions. [2018-12-09 01:33:50,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 2038 transitions. [2018-12-09 01:33:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:33:50,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:50,710 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:50,710 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:50,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1140730340, now seen corresponding path program 1 times [2018-12-09 01:33:50,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:50,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:50,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:50,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:50,774 INFO L87 Difference]: Start difference. First operand 1361 states and 2038 transitions. Second operand 4 states. [2018-12-09 01:33:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:50,999 INFO L93 Difference]: Finished difference Result 3186 states and 4762 transitions. [2018-12-09 01:33:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:51,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-09 01:33:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:51,001 INFO L225 Difference]: With dead ends: 3186 [2018-12-09 01:33:51,001 INFO L226 Difference]: Without dead ends: 1838 [2018-12-09 01:33:51,002 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 01:33:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2018-12-09 01:33:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1499. [2018-12-09 01:33:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-12-09 01:33:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2242 transitions. [2018-12-09 01:33:51,038 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2242 transitions. Word has length 173 [2018-12-09 01:33:51,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:51,038 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 2242 transitions. [2018-12-09 01:33:51,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2242 transitions. [2018-12-09 01:33:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:33:51,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:51,040 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:51,040 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:51,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:51,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2034216678, now seen corresponding path program 1 times [2018-12-09 01:33:51,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:51,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:51,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:51,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:51,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:51,095 INFO L87 Difference]: Start difference. First operand 1499 states and 2242 transitions. Second operand 4 states. [2018-12-09 01:33:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:51,352 INFO L93 Difference]: Finished difference Result 3334 states and 4980 transitions. [2018-12-09 01:33:51,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:51,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-09 01:33:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:51,354 INFO L225 Difference]: With dead ends: 3334 [2018-12-09 01:33:51,354 INFO L226 Difference]: Without dead ends: 1848 [2018-12-09 01:33:51,355 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 01:33:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-12-09 01:33:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1371. [2018-12-09 01:33:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2018-12-09 01:33:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2052 transitions. [2018-12-09 01:33:51,391 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2052 transitions. Word has length 173 [2018-12-09 01:33:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:51,391 INFO L480 AbstractCegarLoop]: Abstraction has 1371 states and 2052 transitions. [2018-12-09 01:33:51,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2052 transitions. [2018-12-09 01:33:51,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 01:33:51,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:51,392 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:51,392 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:51,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash 566394017, now seen corresponding path program 1 times [2018-12-09 01:33:51,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:51,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:51,436 INFO L87 Difference]: Start difference. First operand 1371 states and 2052 transitions. Second operand 4 states. [2018-12-09 01:33:51,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:51,672 INFO L93 Difference]: Finished difference Result 3188 states and 4763 transitions. [2018-12-09 01:33:51,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:51,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-09 01:33:51,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:51,674 INFO L225 Difference]: With dead ends: 3188 [2018-12-09 01:33:51,674 INFO L226 Difference]: Without dead ends: 1830 [2018-12-09 01:33:51,675 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 01:33:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-12-09 01:33:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1515. [2018-12-09 01:33:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-12-09 01:33:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2262 transitions. [2018-12-09 01:33:51,713 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2262 transitions. Word has length 174 [2018-12-09 01:33:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:51,713 INFO L480 AbstractCegarLoop]: Abstraction has 1515 states and 2262 transitions. [2018-12-09 01:33:51,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2262 transitions. [2018-12-09 01:33:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 01:33:51,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:51,714 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:51,714 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1800300577, now seen corresponding path program 1 times [2018-12-09 01:33:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:51,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:51,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:51,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:51,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:51,760 INFO L87 Difference]: Start difference. First operand 1515 states and 2262 transitions. Second operand 4 states. [2018-12-09 01:33:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:51,988 INFO L93 Difference]: Finished difference Result 3337 states and 4977 transitions. [2018-12-09 01:33:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:51,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2018-12-09 01:33:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:51,989 INFO L225 Difference]: With dead ends: 3337 [2018-12-09 01:33:51,989 INFO L226 Difference]: Without dead ends: 1835 [2018-12-09 01:33:51,990 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 01:33:51,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2018-12-09 01:33:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1376. [2018-12-09 01:33:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2018-12-09 01:33:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2056 transitions. [2018-12-09 01:33:52,029 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2056 transitions. Word has length 174 [2018-12-09 01:33:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:52,029 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 2056 transitions. [2018-12-09 01:33:52,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2056 transitions. [2018-12-09 01:33:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 01:33:52,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:52,030 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:52,030 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:52,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1380212793, now seen corresponding path program 1 times [2018-12-09 01:33:52,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:52,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 155 proven. 39 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-12-09 01:33:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:52,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:52,090 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-12-09 01:33:52,090 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:52,092 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:52,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:52,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:52,284 INFO L272 AbstractInterpreter]: Visited 76 different actions 225 times. Merged at 48 different actions 127 times. Never widened. Performed 1807 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 111 variables. [2018-12-09 01:33:52,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:52,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:52,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:52,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:52,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:52,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:52,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:52,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:52,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 01:33:52,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 01:33:52,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:52,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:52,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:52,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:52,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:52,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,387 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:52,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:52,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:52,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:52,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:52,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 155 proven. 39 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-12-09 01:33:52,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:52,424 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:33:52,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:52,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-09 01:33:52,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:52,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 01:33:52,451 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:52,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:52,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:52,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:52,451 INFO L87 Difference]: Start difference. First operand 1376 states and 2056 transitions. Second operand 4 states. [2018-12-09 01:33:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:52,689 INFO L93 Difference]: Finished difference Result 3284 states and 4920 transitions. [2018-12-09 01:33:52,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:52,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-12-09 01:33:52,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:52,690 INFO L225 Difference]: With dead ends: 3284 [2018-12-09 01:33:52,690 INFO L226 Difference]: Without dead ends: 1921 [2018-12-09 01:33:52,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:33:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-12-09 01:33:52,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1442. [2018-12-09 01:33:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-12-09 01:33:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2141 transitions. [2018-12-09 01:33:52,733 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2141 transitions. Word has length 182 [2018-12-09 01:33:52,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:52,733 INFO L480 AbstractCegarLoop]: Abstraction has 1442 states and 2141 transitions. [2018-12-09 01:33:52,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2141 transitions. [2018-12-09 01:33:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-09 01:33:52,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:52,734 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:52,734 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:52,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:52,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1361557335, now seen corresponding path program 1 times [2018-12-09 01:33:52,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:52,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:52,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 162 proven. 34 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-09 01:33:52,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:52,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:52,795 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-12-09 01:33:52,795 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [44], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:52,797 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:52,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:52,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:52,954 INFO L272 AbstractInterpreter]: Visited 75 different actions 221 times. Merged at 47 different actions 124 times. Never widened. Performed 1723 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1723 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 108 variables. [2018-12-09 01:33:52,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:52,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:52,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:52,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:52,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:52,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:53,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:53,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:53,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 01:33:53,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 01:33:53,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:53,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:53,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:53,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:53,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:53,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:53,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 162 proven. 34 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-09 01:33:53,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:53,102 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:33:53,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-09 01:33:53,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:53,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 01:33:53,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:53,131 INFO L87 Difference]: Start difference. First operand 1442 states and 2141 transitions. Second operand 4 states. [2018-12-09 01:33:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:53,396 INFO L93 Difference]: Finished difference Result 3354 states and 4993 transitions. [2018-12-09 01:33:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:53,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-12-09 01:33:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:53,398 INFO L225 Difference]: With dead ends: 3354 [2018-12-09 01:33:53,398 INFO L226 Difference]: Without dead ends: 1925 [2018-12-09 01:33:53,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:33:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-12-09 01:33:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1451. [2018-12-09 01:33:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-12-09 01:33:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2140 transitions. [2018-12-09 01:33:53,450 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2140 transitions. Word has length 182 [2018-12-09 01:33:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:53,450 INFO L480 AbstractCegarLoop]: Abstraction has 1451 states and 2140 transitions. [2018-12-09 01:33:53,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2140 transitions. [2018-12-09 01:33:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:33:53,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:53,452 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:53,452 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:53,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:53,452 INFO L82 PathProgramCache]: Analyzing trace with hash -267828346, now seen corresponding path program 1 times [2018-12-09 01:33:53,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:53,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:53,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:53,526 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 169 proven. 29 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-09 01:33:53,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:53,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:53,526 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2018-12-09 01:33:53,526 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [41], [46], [49], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:53,527 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:53,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:53,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:53,681 INFO L272 AbstractInterpreter]: Visited 75 different actions 221 times. Merged at 47 different actions 124 times. Never widened. Performed 1932 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1932 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 20 fixpoints after 16 different actions. Largest state had 108 variables. [2018-12-09 01:33:53,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:53,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:53,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:53,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:53,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:53,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:53,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:53,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:53,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 01:33:53,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 01:33:53,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:53,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:53,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:53,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:53,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:53,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:53,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:53,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 169 proven. 29 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-12-09 01:33:53,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:53,832 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:33:53,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:53,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-09 01:33:53,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:53,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 01:33:53,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:53,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:53,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:53,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:53,860 INFO L87 Difference]: Start difference. First operand 1451 states and 2140 transitions. Second operand 4 states. [2018-12-09 01:33:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:54,108 INFO L93 Difference]: Finished difference Result 3360 states and 4971 transitions. [2018-12-09 01:33:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:54,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-09 01:33:54,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:54,111 INFO L225 Difference]: With dead ends: 3360 [2018-12-09 01:33:54,111 INFO L226 Difference]: Without dead ends: 1925 [2018-12-09 01:33:54,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 364 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:33:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-12-09 01:33:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1457. [2018-12-09 01:33:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2018-12-09 01:33:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 2135 transitions. [2018-12-09 01:33:54,159 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 2135 transitions. Word has length 183 [2018-12-09 01:33:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:54,159 INFO L480 AbstractCegarLoop]: Abstraction has 1457 states and 2135 transitions. [2018-12-09 01:33:54,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 2135 transitions. [2018-12-09 01:33:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:33:54,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:54,160 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:54,160 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:54,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:54,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1698964166, now seen corresponding path program 1 times [2018-12-09 01:33:54,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:54,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:54,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:33:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:54,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:54,231 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:54,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:54,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:54,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:54,231 INFO L87 Difference]: Start difference. First operand 1457 states and 2135 transitions. Second operand 4 states. [2018-12-09 01:33:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:54,434 INFO L93 Difference]: Finished difference Result 3177 states and 4643 transitions. [2018-12-09 01:33:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:54,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-09 01:33:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:54,436 INFO L225 Difference]: With dead ends: 3177 [2018-12-09 01:33:54,436 INFO L226 Difference]: Without dead ends: 1736 [2018-12-09 01:33:54,437 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 01:33:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2018-12-09 01:33:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1631. [2018-12-09 01:33:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1631 states. [2018-12-09 01:33:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2387 transitions. [2018-12-09 01:33:54,483 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2387 transitions. Word has length 183 [2018-12-09 01:33:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:54,483 INFO L480 AbstractCegarLoop]: Abstraction has 1631 states and 2387 transitions. [2018-12-09 01:33:54,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2387 transitions. [2018-12-09 01:33:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:33:54,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:54,484 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:54,484 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:54,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:54,485 INFO L82 PathProgramCache]: Analyzing trace with hash -312178756, now seen corresponding path program 1 times [2018-12-09 01:33:54,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-09 01:33:54,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:54,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:33:54,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:54,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:33:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:33:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:33:54,579 INFO L87 Difference]: Start difference. First operand 1631 states and 2387 transitions. Second operand 6 states. [2018-12-09 01:33:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:54,899 INFO L93 Difference]: Finished difference Result 3069 states and 4495 transitions. [2018-12-09 01:33:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:33:54,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-12-09 01:33:54,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:54,901 INFO L225 Difference]: With dead ends: 3069 [2018-12-09 01:33:54,901 INFO L226 Difference]: Without dead ends: 1712 [2018-12-09 01:33:54,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2018-12-09 01:33:54,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1636. [2018-12-09 01:33:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-12-09 01:33:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2394 transitions. [2018-12-09 01:33:54,969 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2394 transitions. Word has length 183 [2018-12-09 01:33:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:54,969 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2394 transitions. [2018-12-09 01:33:54,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:33:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2394 transitions. [2018-12-09 01:33:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-09 01:33:54,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:54,971 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:54,971 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:54,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1999870089, now seen corresponding path program 1 times [2018-12-09 01:33:54,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:54,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:54,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2018-12-09 01:33:55,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:55,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:33:55,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:55,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:33:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:33:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:33:55,050 INFO L87 Difference]: Start difference. First operand 1636 states and 2394 transitions. Second operand 6 states. [2018-12-09 01:33:55,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:55,331 INFO L93 Difference]: Finished difference Result 3066 states and 4491 transitions. [2018-12-09 01:33:55,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:33:55,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2018-12-09 01:33:55,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:55,333 INFO L225 Difference]: With dead ends: 3066 [2018-12-09 01:33:55,333 INFO L226 Difference]: Without dead ends: 1709 [2018-12-09 01:33:55,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2018-12-09 01:33:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1637. [2018-12-09 01:33:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2018-12-09 01:33:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2395 transitions. [2018-12-09 01:33:55,380 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2395 transitions. Word has length 184 [2018-12-09 01:33:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:55,380 INFO L480 AbstractCegarLoop]: Abstraction has 1637 states and 2395 transitions. [2018-12-09 01:33:55,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:33:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2395 transitions. [2018-12-09 01:33:55,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-09 01:33:55,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:55,381 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:55,381 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:55,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1133233986, now seen corresponding path program 1 times [2018-12-09 01:33:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:55,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:55,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:33:55,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:55,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:55,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:55,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:55,474 INFO L87 Difference]: Start difference. First operand 1637 states and 2395 transitions. Second operand 4 states. [2018-12-09 01:33:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:55,760 INFO L93 Difference]: Finished difference Result 3809 states and 5580 transitions. [2018-12-09 01:33:55,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:55,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-12-09 01:33:55,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:55,762 INFO L225 Difference]: With dead ends: 3809 [2018-12-09 01:33:55,762 INFO L226 Difference]: Without dead ends: 2194 [2018-12-09 01:33:55,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:33:55,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2018-12-09 01:33:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1793. [2018-12-09 01:33:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-12-09 01:33:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2641 transitions. [2018-12-09 01:33:55,815 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2641 transitions. Word has length 198 [2018-12-09 01:33:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:55,815 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2641 transitions. [2018-12-09 01:33:55,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2641 transitions. [2018-12-09 01:33:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-09 01:33:55,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:55,817 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:55,817 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:55,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1267247492, now seen corresponding path program 1 times [2018-12-09 01:33:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:55,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:55,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:55,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:33:55,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:55,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:55,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:55,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:55,868 INFO L87 Difference]: Start difference. First operand 1793 states and 2641 transitions. Second operand 4 states. [2018-12-09 01:33:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:56,152 INFO L93 Difference]: Finished difference Result 4109 states and 6060 transitions. [2018-12-09 01:33:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:56,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-12-09 01:33:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:56,154 INFO L225 Difference]: With dead ends: 4109 [2018-12-09 01:33:56,154 INFO L226 Difference]: Without dead ends: 2338 [2018-12-09 01:33:56,155 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 01:33:56,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-12-09 01:33:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1787. [2018-12-09 01:33:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2018-12-09 01:33:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2635 transitions. [2018-12-09 01:33:56,208 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2635 transitions. Word has length 198 [2018-12-09 01:33:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:56,208 INFO L480 AbstractCegarLoop]: Abstraction has 1787 states and 2635 transitions. [2018-12-09 01:33:56,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2635 transitions. [2018-12-09 01:33:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 01:33:56,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:56,209 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:56,210 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:56,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 77977526, now seen corresponding path program 1 times [2018-12-09 01:33:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:56,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:56,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:56,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-09 01:33:56,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:56,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:56,297 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 200 with the following transitions: [2018-12-09 01:33:56,298 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [54], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:56,299 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:56,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:56,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:56,480 INFO L272 AbstractInterpreter]: Visited 77 different actions 284 times. Merged at 49 different actions 173 times. Never widened. Performed 2317 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2317 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-09 01:33:56,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:56,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:56,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:56,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:56,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:56,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:56,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:56,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:56,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 01:33:56,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 01:33:56,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:56,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:56,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:56,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:56,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:56,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,598 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:56,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:56,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:56,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:56,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:56,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 196 proven. 24 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2018-12-09 01:33:56,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:56,650 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:33:56,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:56,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 489 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-09 01:33:56,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:56,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 01:33:56,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:56,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:56,702 INFO L87 Difference]: Start difference. First operand 1787 states and 2635 transitions. Second operand 4 states. [2018-12-09 01:33:56,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:56,957 INFO L93 Difference]: Finished difference Result 4020 states and 5941 transitions. [2018-12-09 01:33:56,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:56,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-09 01:33:56,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:56,959 INFO L225 Difference]: With dead ends: 4020 [2018-12-09 01:33:56,959 INFO L226 Difference]: Without dead ends: 2255 [2018-12-09 01:33:56,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 396 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:33:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2018-12-09 01:33:57,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 1793. [2018-12-09 01:33:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2018-12-09 01:33:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2623 transitions. [2018-12-09 01:33:57,018 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2623 transitions. Word has length 199 [2018-12-09 01:33:57,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:57,018 INFO L480 AbstractCegarLoop]: Abstraction has 1793 states and 2623 transitions. [2018-12-09 01:33:57,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:57,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2623 transitions. [2018-12-09 01:33:57,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 01:33:57,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:57,020 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:57,020 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:57,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 766097269, now seen corresponding path program 1 times [2018-12-09 01:33:57,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:57,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:33:57,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:57,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:57,100 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:57,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:57,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:57,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:57,101 INFO L87 Difference]: Start difference. First operand 1793 states and 2623 transitions. Second operand 4 states. [2018-12-09 01:33:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:57,399 INFO L93 Difference]: Finished difference Result 4095 states and 5999 transitions. [2018-12-09 01:33:57,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:57,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-09 01:33:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:57,401 INFO L225 Difference]: With dead ends: 4095 [2018-12-09 01:33:57,401 INFO L226 Difference]: Without dead ends: 2324 [2018-12-09 01:33:57,402 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 01:33:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2018-12-09 01:33:57,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1922. [2018-12-09 01:33:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2018-12-09 01:33:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2821 transitions. [2018-12-09 01:33:57,459 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2821 transitions. Word has length 199 [2018-12-09 01:33:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:57,459 INFO L480 AbstractCegarLoop]: Abstraction has 1922 states and 2821 transitions. [2018-12-09 01:33:57,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2821 transitions. [2018-12-09 01:33:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-09 01:33:57,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:57,461 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:57,461 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:57,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash 625548659, now seen corresponding path program 1 times [2018-12-09 01:33:57,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:57,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:33:57,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:57,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:57,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:57,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:57,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:57,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:57,520 INFO L87 Difference]: Start difference. First operand 1922 states and 2821 transitions. Second operand 4 states. [2018-12-09 01:33:57,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:57,808 INFO L93 Difference]: Finished difference Result 4203 states and 6161 transitions. [2018-12-09 01:33:57,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:57,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-12-09 01:33:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:57,810 INFO L225 Difference]: With dead ends: 4203 [2018-12-09 01:33:57,810 INFO L226 Difference]: Without dead ends: 2303 [2018-12-09 01:33:57,812 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 01:33:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2018-12-09 01:33:57,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 1772. [2018-12-09 01:33:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1772 states. [2018-12-09 01:33:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2587 transitions. [2018-12-09 01:33:57,869 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2587 transitions. Word has length 199 [2018-12-09 01:33:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:57,869 INFO L480 AbstractCegarLoop]: Abstraction has 1772 states and 2587 transitions. [2018-12-09 01:33:57,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2587 transitions. [2018-12-09 01:33:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-09 01:33:57,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:57,871 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:57,871 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:57,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2103902609, now seen corresponding path program 1 times [2018-12-09 01:33:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:57,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-09 01:33:57,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:57,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:57,923 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-12-09 01:33:57,924 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [59], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [247], [253], [256], [261], [264], [272], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:57,925 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:57,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:58,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:58,096 INFO L272 AbstractInterpreter]: Visited 77 different actions 284 times. Merged at 49 different actions 173 times. Never widened. Performed 2317 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2317 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-09 01:33:58,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:58,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:58,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:58,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:58,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:58,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:58,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:58,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-09 01:33:58,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-09 01:33:58,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-09 01:33:58,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 01:33:58,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-09 01:33:58,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:58,200 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:58,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:58,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2018-12-09 01:33:58,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:58,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:58,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:58,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:58,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 203 proven. 19 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-12-09 01:33:58,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:58,270 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:33:58,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:58,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-12-09 01:33:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-12-09 01:33:58,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:33:58,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 8 [2018-12-09 01:33:58,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:58,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:58,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:58,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:33:58,299 INFO L87 Difference]: Start difference. First operand 1772 states and 2587 transitions. Second operand 4 states. [2018-12-09 01:33:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:58,562 INFO L93 Difference]: Finished difference Result 3676 states and 5380 transitions. [2018-12-09 01:33:58,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:58,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-12-09 01:33:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:58,564 INFO L225 Difference]: With dead ends: 3676 [2018-12-09 01:33:58,564 INFO L226 Difference]: Without dead ends: 1926 [2018-12-09 01:33:58,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 398 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:33:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2018-12-09 01:33:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1543. [2018-12-09 01:33:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1543 states. [2018-12-09 01:33:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 2230 transitions. [2018-12-09 01:33:58,617 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 2230 transitions. Word has length 200 [2018-12-09 01:33:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:58,617 INFO L480 AbstractCegarLoop]: Abstraction has 1543 states and 2230 transitions. [2018-12-09 01:33:58,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2230 transitions. [2018-12-09 01:33:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-09 01:33:58,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:58,619 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:58,619 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:58,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1918946349, now seen corresponding path program 1 times [2018-12-09 01:33:58,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:58,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:58,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:58,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-09 01:33:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:58,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:58,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:58,675 INFO L87 Difference]: Start difference. First operand 1543 states and 2230 transitions. Second operand 4 states. [2018-12-09 01:33:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:58,885 INFO L93 Difference]: Finished difference Result 3214 states and 4652 transitions. [2018-12-09 01:33:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:33:58,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-12-09 01:33:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:58,886 INFO L225 Difference]: With dead ends: 3214 [2018-12-09 01:33:58,887 INFO L226 Difference]: Without dead ends: 1693 [2018-12-09 01:33:58,888 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 01:33:58,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-12-09 01:33:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1588. [2018-12-09 01:33:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:33:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2305 transitions. [2018-12-09 01:33:58,939 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2305 transitions. Word has length 204 [2018-12-09 01:33:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:58,940 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2305 transitions. [2018-12-09 01:33:58,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:33:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2305 transitions. [2018-12-09 01:33:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 01:33:58,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:58,941 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:58,941 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:58,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash -684916523, now seen corresponding path program 1 times [2018-12-09 01:33:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:58,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:58,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:58,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 361 proven. 1 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-12-09 01:33:59,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:59,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:33:59,042 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-12-09 01:33:59,042 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:33:59,043 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:33:59,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:33:59,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:33:59,181 INFO L272 AbstractInterpreter]: Visited 78 different actions 241 times. Merged at 52 different actions 137 times. Never widened. Performed 1958 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1958 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 17 different actions. Largest state had 111 variables. [2018-12-09 01:33:59,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:59,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:33:59,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:59,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:59,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:33:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:59,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:59,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:33:59,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:33:59,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:33:59,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:33:59,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:59,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:59,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:33:59,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:33:59,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:33:59,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:59,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:33:59,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:33:59,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:33:59,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:33:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-09 01:33:59,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-09 01:33:59,358 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:33:59,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:33:59,358 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:59,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:33:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:33:59,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:33:59,359 INFO L87 Difference]: Start difference. First operand 1588 states and 2305 transitions. Second operand 5 states. [2018-12-09 01:33:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:59,649 INFO L93 Difference]: Finished difference Result 3439 states and 5006 transitions. [2018-12-09 01:33:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:33:59,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 206 [2018-12-09 01:33:59,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:59,650 INFO L225 Difference]: With dead ends: 3439 [2018-12-09 01:33:59,650 INFO L226 Difference]: Without dead ends: 1873 [2018-12-09 01:33:59,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 408 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:33:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2018-12-09 01:33:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1598. [2018-12-09 01:33:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-09 01:33:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2320 transitions. [2018-12-09 01:33:59,719 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2320 transitions. Word has length 206 [2018-12-09 01:33:59,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:59,719 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2320 transitions. [2018-12-09 01:33:59,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:33:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2320 transitions. [2018-12-09 01:33:59,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 01:33:59,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:59,720 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:59,720 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:33:59,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash -566083999, now seen corresponding path program 1 times [2018-12-09 01:33:59,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:33:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:59,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:33:59,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:33:59,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:33:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:33:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-09 01:33:59,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:33:59,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:33:59,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:33:59,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:33:59,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:33:59,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:33:59,781 INFO L87 Difference]: Start difference. First operand 1598 states and 2320 transitions. Second operand 4 states. [2018-12-09 01:34:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:00,019 INFO L93 Difference]: Finished difference Result 3264 states and 4732 transitions. [2018-12-09 01:34:00,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:00,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-09 01:34:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:00,021 INFO L225 Difference]: With dead ends: 3264 [2018-12-09 01:34:00,021 INFO L226 Difference]: Without dead ends: 1688 [2018-12-09 01:34:00,022 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 01:34:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-12-09 01:34:00,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1598. [2018-12-09 01:34:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-09 01:34:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2315 transitions. [2018-12-09 01:34:00,098 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2315 transitions. Word has length 206 [2018-12-09 01:34:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:00,098 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2315 transitions. [2018-12-09 01:34:00,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2315 transitions. [2018-12-09 01:34:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-09 01:34:00,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:00,099 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:00,100 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:00,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -983480605, now seen corresponding path program 1 times [2018-12-09 01:34:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:00,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:00,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:00,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:00,170 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-09 01:34:00,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:00,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:00,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:00,170 INFO L87 Difference]: Start difference. First operand 1598 states and 2315 transitions. Second operand 4 states. [2018-12-09 01:34:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:00,373 INFO L93 Difference]: Finished difference Result 3279 states and 4742 transitions. [2018-12-09 01:34:00,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:00,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2018-12-09 01:34:00,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:00,374 INFO L225 Difference]: With dead ends: 3279 [2018-12-09 01:34:00,374 INFO L226 Difference]: Without dead ends: 1703 [2018-12-09 01:34:00,375 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 01:34:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2018-12-09 01:34:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1598. [2018-12-09 01:34:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-12-09 01:34:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2310 transitions. [2018-12-09 01:34:00,430 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2310 transitions. Word has length 206 [2018-12-09 01:34:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:00,430 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2310 transitions. [2018-12-09 01:34:00,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2310 transitions. [2018-12-09 01:34:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 01:34:00,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:00,431 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:00,431 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:00,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash -194083888, now seen corresponding path program 1 times [2018-12-09 01:34:00,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:00,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:00,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:00,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:00,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-12-09 01:34:00,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:00,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:34:00,577 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 208 with the following transitions: [2018-12-09 01:34:00,577 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [99], [101], [104], [106], [111], [114], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:34:00,578 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:34:00,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:34:00,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:34:00,715 INFO L272 AbstractInterpreter]: Visited 79 different actions 245 times. Merged at 52 different actions 137 times. Never widened. Performed 1970 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 31 fixpoints after 18 different actions. Largest state had 111 variables. [2018-12-09 01:34:00,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:00,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:34:00,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:00,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:34:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:00,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:34:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:00,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:34:00,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:34:00,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:34:00,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:34:00,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:34:00,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:00,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:00,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:34:00,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:34:00,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:34:00,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:00,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:00,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:34:00,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:00,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:34:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-09 01:34:00,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:34:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-09 01:34:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:34:00,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:34:00,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:00,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:34:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:34:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:34:00,904 INFO L87 Difference]: Start difference. First operand 1598 states and 2310 transitions. Second operand 5 states. [2018-12-09 01:34:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:01,246 INFO L93 Difference]: Finished difference Result 3434 states and 4978 transitions. [2018-12-09 01:34:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:34:01,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2018-12-09 01:34:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:01,247 INFO L225 Difference]: With dead ends: 3434 [2018-12-09 01:34:01,247 INFO L226 Difference]: Without dead ends: 1858 [2018-12-09 01:34:01,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 410 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:34:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-12-09 01:34:01,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1603. [2018-12-09 01:34:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-09 01:34:01,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2315 transitions. [2018-12-09 01:34:01,303 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2315 transitions. Word has length 207 [2018-12-09 01:34:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:01,303 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2315 transitions. [2018-12-09 01:34:01,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:34:01,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2315 transitions. [2018-12-09 01:34:01,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 01:34:01,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:01,304 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:01,304 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:01,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:01,305 INFO L82 PathProgramCache]: Analyzing trace with hash -44226318, now seen corresponding path program 1 times [2018-12-09 01:34:01,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:01,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-09 01:34:01,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:01,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:01,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:01,355 INFO L87 Difference]: Start difference. First operand 1603 states and 2315 transitions. Second operand 4 states. [2018-12-09 01:34:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:01,546 INFO L93 Difference]: Finished difference Result 3249 states and 4688 transitions. [2018-12-09 01:34:01,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:01,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-09 01:34:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:01,547 INFO L225 Difference]: With dead ends: 3249 [2018-12-09 01:34:01,547 INFO L226 Difference]: Without dead ends: 1668 [2018-12-09 01:34:01,548 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 01:34:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-12-09 01:34:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1603. [2018-12-09 01:34:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-09 01:34:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2310 transitions. [2018-12-09 01:34:01,603 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2310 transitions. Word has length 207 [2018-12-09 01:34:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:01,603 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2310 transitions. [2018-12-09 01:34:01,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2310 transitions. [2018-12-09 01:34:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-09 01:34:01,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:01,604 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:01,604 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:01,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash -98619216, now seen corresponding path program 1 times [2018-12-09 01:34:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:01,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-12-09 01:34:01,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:01,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:01,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:01,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:01,656 INFO L87 Difference]: Start difference. First operand 1603 states and 2310 transitions. Second operand 4 states. [2018-12-09 01:34:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:01,865 INFO L93 Difference]: Finished difference Result 3264 states and 4698 transitions. [2018-12-09 01:34:01,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:01,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2018-12-09 01:34:01,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:01,866 INFO L225 Difference]: With dead ends: 3264 [2018-12-09 01:34:01,867 INFO L226 Difference]: Without dead ends: 1683 [2018-12-09 01:34:01,867 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 01:34:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-12-09 01:34:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1603. [2018-12-09 01:34:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-09 01:34:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2305 transitions. [2018-12-09 01:34:01,922 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2305 transitions. Word has length 207 [2018-12-09 01:34:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:01,923 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2305 transitions. [2018-12-09 01:34:01,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2305 transitions. [2018-12-09 01:34:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 01:34:01,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:01,924 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:01,924 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:01,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:01,924 INFO L82 PathProgramCache]: Analyzing trace with hash -267630020, now seen corresponding path program 1 times [2018-12-09 01:34:01,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:01,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:01,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:01,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:34:02,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:02,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:02,023 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:02,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:02,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:02,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:02,023 INFO L87 Difference]: Start difference. First operand 1603 states and 2305 transitions. Second operand 4 states. [2018-12-09 01:34:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:02,324 INFO L93 Difference]: Finished difference Result 3584 states and 5175 transitions. [2018-12-09 01:34:02,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:02,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-09 01:34:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:02,326 INFO L225 Difference]: With dead ends: 3584 [2018-12-09 01:34:02,326 INFO L226 Difference]: Without dead ends: 2003 [2018-12-09 01:34:02,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:34:02,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-09 01:34:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1718. [2018-12-09 01:34:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2018-12-09 01:34:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2475 transitions. [2018-12-09 01:34:02,384 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2475 transitions. Word has length 219 [2018-12-09 01:34:02,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:02,384 INFO L480 AbstractCegarLoop]: Abstraction has 1718 states and 2475 transitions. [2018-12-09 01:34:02,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2475 transitions. [2018-12-09 01:34:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-09 01:34:02,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:02,386 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:02,386 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:02,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1161116358, now seen corresponding path program 1 times [2018-12-09 01:34:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:02,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:02,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:34:02,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:02,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:02,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:02,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:02,441 INFO L87 Difference]: Start difference. First operand 1718 states and 2475 transitions. Second operand 4 states. [2018-12-09 01:34:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:02,709 INFO L93 Difference]: Finished difference Result 3699 states and 5340 transitions. [2018-12-09 01:34:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:02,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-12-09 01:34:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:02,711 INFO L225 Difference]: With dead ends: 3699 [2018-12-09 01:34:02,711 INFO L226 Difference]: Without dead ends: 2003 [2018-12-09 01:34:02,712 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 01:34:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2018-12-09 01:34:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1603. [2018-12-09 01:34:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1603 states. [2018-12-09 01:34:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2300 transitions. [2018-12-09 01:34:02,770 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2300 transitions. Word has length 219 [2018-12-09 01:34:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:02,771 INFO L480 AbstractCegarLoop]: Abstraction has 1603 states and 2300 transitions. [2018-12-09 01:34:02,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2300 transitions. [2018-12-09 01:34:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 01:34:02,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:02,772 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:02,772 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:02,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -143104183, now seen corresponding path program 1 times [2018-12-09 01:34:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:02,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:02,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:02,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:34:02,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:02,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:02,859 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:02,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:02,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:02,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:02,859 INFO L87 Difference]: Start difference. First operand 1603 states and 2300 transitions. Second operand 4 states. [2018-12-09 01:34:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:03,147 INFO L93 Difference]: Finished difference Result 3569 states and 5142 transitions. [2018-12-09 01:34:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:03,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-12-09 01:34:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:03,149 INFO L225 Difference]: With dead ends: 3569 [2018-12-09 01:34:03,149 INFO L226 Difference]: Without dead ends: 1988 [2018-12-09 01:34:03,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 8 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:34:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-12-09 01:34:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1708. [2018-12-09 01:34:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1708 states. [2018-12-09 01:34:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2455 transitions. [2018-12-09 01:34:03,209 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2455 transitions. Word has length 220 [2018-12-09 01:34:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:03,209 INFO L480 AbstractCegarLoop]: Abstraction has 1708 states and 2455 transitions. [2018-12-09 01:34:03,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:03,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2455 transitions. [2018-12-09 01:34:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-09 01:34:03,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:03,211 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:03,211 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:03,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2071376885, now seen corresponding path program 1 times [2018-12-09 01:34:03,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:03,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:03,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:03,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-12-09 01:34:03,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:34:03,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 01:34:03,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:03,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:34:03,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:34:03,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:34:03,277 INFO L87 Difference]: Start difference. First operand 1708 states and 2455 transitions. Second operand 4 states. [2018-12-09 01:34:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:03,757 INFO L93 Difference]: Finished difference Result 3659 states and 5272 transitions. [2018-12-09 01:34:03,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:34:03,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2018-12-09 01:34:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:03,759 INFO L225 Difference]: With dead ends: 3659 [2018-12-09 01:34:03,759 INFO L226 Difference]: Without dead ends: 1973 [2018-12-09 01:34:03,760 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 01:34:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2018-12-09 01:34:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1588. [2018-12-09 01:34:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:34:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2275 transitions. [2018-12-09 01:34:03,821 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2275 transitions. Word has length 220 [2018-12-09 01:34:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:03,821 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2275 transitions. [2018-12-09 01:34:03,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:34:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2275 transitions. [2018-12-09 01:34:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:34:03,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:03,822 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:03,822 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:03,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1231144124, now seen corresponding path program 1 times [2018-12-09 01:34:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:03,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:03,926 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-09 01:34:03,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:03,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:34:03,927 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-09 01:34:03,927 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:34:03,928 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:34:03,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:34:04,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:34:04,179 INFO L272 AbstractInterpreter]: Visited 94 different actions 295 times. Merged at 65 different actions 174 times. Never widened. Performed 2676 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2676 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 28 fixpoints after 19 different actions. Largest state had 136 variables. [2018-12-09 01:34:04,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:04,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:34:04,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:04,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:34:04,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:04,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:34:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:04,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:34:04,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:34:04,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:34:04,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:34:04,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:34:04,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:04,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:04,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:34:04,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:34:04,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:34:04,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:04,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:04,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:34:04,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:04,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:34:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:04,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:34:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:04,376 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:34:04,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:34:04,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:04,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:34:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:34:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:34:04,376 INFO L87 Difference]: Start difference. First operand 1588 states and 2275 transitions. Second operand 5 states. [2018-12-09 01:34:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:04,668 INFO L93 Difference]: Finished difference Result 3224 states and 4613 transitions. [2018-12-09 01:34:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:34:04,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-12-09 01:34:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:04,670 INFO L225 Difference]: With dead ends: 3224 [2018-12-09 01:34:04,670 INFO L226 Difference]: Without dead ends: 1658 [2018-12-09 01:34:04,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 440 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:34:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-12-09 01:34:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1588. [2018-12-09 01:34:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:34:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2270 transitions. [2018-12-09 01:34:04,732 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2270 transitions. Word has length 222 [2018-12-09 01:34:04,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:04,732 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2270 transitions. [2018-12-09 01:34:04,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:34:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2270 transitions. [2018-12-09 01:34:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-09 01:34:04,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:04,734 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:04,734 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:04,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:04,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1471383870, now seen corresponding path program 1 times [2018-12-09 01:34:04,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:04,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:04,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:04,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:04,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 363 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-09 01:34:04,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:04,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:34:04,832 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-12-09 01:34:04,832 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:34:04,834 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:34:04,834 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:34:05,091 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:34:05,091 INFO L272 AbstractInterpreter]: Visited 94 different actions 368 times. Merged at 66 different actions 237 times. Never widened. Performed 3045 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3045 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 20 different actions. Largest state had 136 variables. [2018-12-09 01:34:05,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:05,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:34:05,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:05,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:34:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:05,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:34:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:05,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:34:05,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:34:05,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:34:05,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:34:05,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:34:05,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:05,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:05,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:34:05,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:34:05,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:34:05,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:05,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:05,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:34:05,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:05,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:34:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:05,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:34:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:05,301 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:34:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:34:05,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:05,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:34:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:34:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:34:05,302 INFO L87 Difference]: Start difference. First operand 1588 states and 2270 transitions. Second operand 5 states. [2018-12-09 01:34:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:05,593 INFO L93 Difference]: Finished difference Result 3239 states and 4623 transitions. [2018-12-09 01:34:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:34:05,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2018-12-09 01:34:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:05,595 INFO L225 Difference]: With dead ends: 3239 [2018-12-09 01:34:05,595 INFO L226 Difference]: Without dead ends: 1673 [2018-12-09 01:34:05,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 440 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:34:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2018-12-09 01:34:05,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1588. [2018-12-09 01:34:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:34:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2265 transitions. [2018-12-09 01:34:05,656 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2265 transitions. Word has length 222 [2018-12-09 01:34:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2265 transitions. [2018-12-09 01:34:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:34:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2265 transitions. [2018-12-09 01:34:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-09 01:34:05,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:05,657 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:05,657 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:05,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1343437651, now seen corresponding path program 1 times [2018-12-09 01:34:05,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:05,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:34:05,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:05,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:34:05,774 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-09 01:34:05,774 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [345], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:34:05,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:34:05,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:34:06,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:34:06,066 INFO L272 AbstractInterpreter]: Visited 95 different actions 373 times. Merged at 66 different actions 237 times. Never widened. Performed 3389 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3389 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-09 01:34:06,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:06,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:34:06,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:06,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:34:06,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:06,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:34:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:06,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:34:06,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:34:06,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:34:06,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:34:06,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:34:06,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:06,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:06,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:34:06,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:34:06,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:34:06,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:06,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:06,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:34:06,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:06,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:34:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:06,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:34:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:06,256 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:34:06,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:34:06,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:06,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:34:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:34:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:34:06,257 INFO L87 Difference]: Start difference. First operand 1588 states and 2265 transitions. Second operand 5 states. [2018-12-09 01:34:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:06,526 INFO L93 Difference]: Finished difference Result 3204 states and 4564 transitions. [2018-12-09 01:34:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:34:06,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-12-09 01:34:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:06,528 INFO L225 Difference]: With dead ends: 3204 [2018-12-09 01:34:06,528 INFO L226 Difference]: Without dead ends: 1638 [2018-12-09 01:34:06,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 442 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:34:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2018-12-09 01:34:06,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1588. [2018-12-09 01:34:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:34:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2260 transitions. [2018-12-09 01:34:06,590 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2260 transitions. Word has length 223 [2018-12-09 01:34:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:06,590 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2260 transitions. [2018-12-09 01:34:06,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:34:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2260 transitions. [2018-12-09 01:34:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-09 01:34:06,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:06,591 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:06,591 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:06,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1809027179, now seen corresponding path program 1 times [2018-12-09 01:34:06,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:06,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:06,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 365 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 01:34:06,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:06,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:34:06,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 224 with the following transitions: [2018-12-09 01:34:06,690 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [5], [14], [25], [34], [36], [39], [41], [46], [51], [56], [61], [64], [66], [71], [74], [76], [79], [81], [84], [86], [91], [94], [96], [101], [104], [106], [111], [114], [116], [121], [126], [131], [136], [141], [146], [151], [156], [161], [164], [204], [206], [209], [213], [218], [228], [230], [235], [240], [242], [245], [253], [256], [261], [264], [266], [272], [275], [277], [279], [281], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [379], [384], [387], [391], [396], [401], [484], [518], [520], [532], [538], [542], [543], [544], [546] [2018-12-09 01:34:06,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:34:06,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:34:07,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:34:07,011 INFO L272 AbstractInterpreter]: Visited 95 different actions 373 times. Merged at 66 different actions 237 times. Never widened. Performed 3389 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3389 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 41 fixpoints after 21 different actions. Largest state had 136 variables. [2018-12-09 01:34:07,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:07,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:34:07,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:34:07,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:34:07,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:07,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:34:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:34:07,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:34:07,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:34:07,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:34:07,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 01:34:07,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-12-09 01:34:07,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:07,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:07,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:34:07,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-09 01:34:07,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 01:34:07,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:07,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:34:07,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 01:34:07,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:34:07,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-12-09 01:34:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:07,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:34:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-09 01:34:07,204 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:34:07,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 10 [2018-12-09 01:34:07,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:34:07,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:34:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:34:07,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:34:07,205 INFO L87 Difference]: Start difference. First operand 1588 states and 2260 transitions. Second operand 5 states. [2018-12-09 01:34:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:34:07,416 INFO L93 Difference]: Finished difference Result 3219 states and 4574 transitions. [2018-12-09 01:34:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:34:07,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2018-12-09 01:34:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:34:07,417 INFO L225 Difference]: With dead ends: 3219 [2018-12-09 01:34:07,417 INFO L226 Difference]: Without dead ends: 1653 [2018-12-09 01:34:07,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 442 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:34:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-12-09 01:34:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1588. [2018-12-09 01:34:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-12-09 01:34:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2255 transitions. [2018-12-09 01:34:07,480 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2255 transitions. Word has length 223 [2018-12-09 01:34:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:34:07,480 INFO L480 AbstractCegarLoop]: Abstraction has 1588 states and 2255 transitions. [2018-12-09 01:34:07,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:34:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2255 transitions. [2018-12-09 01:34:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-12-09 01:34:07,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:34:07,481 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:34:07,481 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 01:34:07,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:34:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1461231581, now seen corresponding path program 1 times [2018-12-09 01:34:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:34:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:07,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:34:07,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:34:07,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:34:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:34:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:34:08,436 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 01:34:08,492 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20494 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 01:34:08,493 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20486 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-09 01:34:08,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:34:08 BoogieIcfgContainer [2018-12-09 01:34:08,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:34:08,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:34:08,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:34:08,569 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:34:08,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:33:36" (3/4) ... [2018-12-09 01:34:08,571 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 01:34:08,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:34:08,572 INFO L168 Benchmark]: Toolchain (without parser) took 33093.25 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 956.0 MB in the beginning and 811.8 MB in the end (delta: 144.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: Boogie Preprocessor took 44.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: RCFGBuilder took 569.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: TraceAbstraction took 32089.47 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 811.8 MB in the end (delta: 210.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-09 01:34:08,573 INFO L168 Benchmark]: Witness Printer took 3.02 ms. Allocated memory is still 2.2 GB. Free memory is still 811.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:34:08,574 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 569.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32089.47 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 1.0 GB in the beginning and 811.8 MB in the end (delta: 210.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 3.02 ms. Allocated memory is still 2.2 GB. Free memory is still 811.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20494 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20486 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1646]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1331. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20546, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20497:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20506:0}, SSLv3_client_data={20497:0}] [L1080] BUF_MEM *buf = __VERIFIER_nondet_pointer() ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 ; [L1093] int tmp___4 ; [L1094] int tmp___5 ; [L1095] int tmp___6 ; [L1096] int tmp___7 ; [L1097] int tmp___8 ; [L1098] long tmp___9 ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] *tmp___0 = 0 [L1111] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=12292, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1250] EXPR s->version VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->version=1, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->init_buf={-1:2}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=12292, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=0, buf={20516:20522}, init=1, ret=-1, s={20506:0}, s={20506:0}, s->state=4368, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4368, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=1, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4384, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->hit=0, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1327] s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4384, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->state=4400, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20543, (s->s3)->tmp.new_cipher={20506:0}, blastFlag=2, buf={20516:20522}, init=1, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1340] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4400, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=3, buf={20516:20522}, init=1, ret=10, s={20506:0}, s={20506:0}, s->state=4416, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4416, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=5, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=4, buf={20516:20522}, init=1, ret=6, s={20506:0}, s={20506:0}, s->state=4448, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 [L1392] blastFlag = 5 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1396] COND FALSE !(ret <= 0) [L1401] EXPR s->s3 [L1401] (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1401] COND FALSE !((s->s3)->tmp.cert_req) [L1404] s->state = 4480 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1406] s->init_num = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4448, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, ret=7, s={20506:0}, s={20506:0}, s->state=4480, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1197] COND TRUE s->state == 4480 [L1423] ret = __VERIFIER_nondet_int() [L1424] COND FALSE !(ret <= 0) [L1429] EXPR s->s3 [L1429] EXPR (s->s3)->tmp.new_cipher [L1429] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1429] l = ((s->s3)->tmp.new_cipher)->algorithms [L1430] EXPR s->s3 [L1430] EXPR (s->s3)->tmp.cert_req VAL [={1:0}, (s->s3)->tmp.cert_req=0, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1430] COND FALSE !((s->s3)->tmp.cert_req == 1) [L1433] s->state = 4512 [L1434] EXPR s->s3 [L1434] (s->s3)->change_cipher_spec = 0 [L1436] s->init_num = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4480, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1179] COND FALSE !(s->state == 4448) [L1182] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1182] COND FALSE !(s->state == 4449) [L1185] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1185] COND FALSE !(s->state == 4464) [L1188] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1188] COND FALSE !(s->state == 4465) [L1191] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1191] COND FALSE !(s->state == 4466) [L1194] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1194] COND FALSE !(s->state == 4467) [L1197] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1197] COND FALSE !(s->state == 4480) [L1200] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1200] COND FALSE !(s->state == 4481) [L1203] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1203] COND FALSE !(s->state == 4496) [L1206] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1206] COND FALSE !(s->state == 4497) [L1209] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4512, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1209] COND TRUE s->state == 4512 [L1452] ret = __VERIFIER_nondet_int() [L1453] COND FALSE !(ret <= 0) [L1458] s->state = 4528 [L1459] s->init_num = 0 [L1460] EXPR s->session [L1460] EXPR s->s3 [L1460] EXPR (s->s3)->tmp.new_cipher [L1460] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1461] EXPR s->s3 [L1461] EXPR (s->s3)->tmp.new_compression VAL [={1:0}, (s->s3)->tmp.new_compression={0:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1461] COND TRUE (unsigned long )(s->s3)->tmp.new_compression == (unsigned long )((void *)0) [L1462] EXPR s->session [L1462] (s->session)->compress_meth = 0 [L1466] tmp___7 = __VERIFIER_nondet_int() [L1467] COND FALSE !(! tmp___7) [L1473] tmp___8 = __VERIFIER_nondet_int() [L1474] COND FALSE !(! tmp___8) VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20487, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->s3={20512:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1131] COND TRUE 1 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4512, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=1, s={20506:0}, s={20506:0}, s->state=4432, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND TRUE blastFlag == 5 VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=0, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] [L1646] __VERIFIER_error() VAL [={1:0}, blastFlag=5, buf={20516:20522}, init=1, l=20543, ret=0, s={20506:0}, s={20506:0}, skip=0, SSLv3_client_data={20497:0}, state=4432, tmp=0, tmp___0={20506:204}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=1, tmp___8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 32.0s OverallTime, 79 OverallIterations, 10 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16894 SDtfs, 6526 SDslu, 23774 SDs, 0 SdLazy, 15020 SolverSat, 686 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5652 GetRequests, 5176 SyntacticMatches, 174 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1922occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 13 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 78 MinimizatonAttempts, 18056 StatesRemovedByMinimization, 73 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 14439 NumberOfCodeBlocks, 14439 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 16646 ConstructedInterpolants, 0 QuantifiedInterpolants, 7813773 SizeOfPredicates, 53 NumberOfNonLiveVariables, 11071 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 104 InterpolantComputations, 84 PerfectInterpolantSequences, 34958/35271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:34:09,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:34:09,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:34:09,973 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:34:09,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:34:09,973 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:34:09,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:34:09,975 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:34:09,976 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:34:09,976 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:34:09,976 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:34:09,977 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:34:09,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:34:09,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:34:09,978 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:34:09,978 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:34:09,979 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:34:09,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:34:09,980 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:34:09,981 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:34:09,982 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:34:09,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:34:09,983 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:34:09,983 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:34:09,984 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:34:09,984 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:34:09,985 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:34:09,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:34:09,985 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:34:09,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:34:09,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:34:09,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:34:09,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:34:09,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:34:09,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:34:09,987 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:34:09,987 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 01:34:09,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:34:09,995 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:34:09,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:34:09,995 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:34:09,995 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:34:09,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:34:09,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:34:09,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:34:09,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:34:09,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:34:09,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:34:09,998 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 01:34:09,998 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_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07be4c432baffc0b0315a344289242773ed6234f [2018-12-09 01:34:10,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:34:10,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:34:10,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:34:10,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:34:10,027 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:34:10,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-09 01:34:10,064 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/20dd7903d/37bc3ac4f5494625ae41a906645c74a4/FLAG5157e017c [2018-12-09 01:34:10,523 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:34:10,523 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/sv-benchmarks/c/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-12-09 01:34:10,531 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/20dd7903d/37bc3ac4f5494625ae41a906645c74a4/FLAG5157e017c [2018-12-09 01:34:10,539 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94a34f3a-2185-4dae-b7cc-760e78d11bfd/bin-2019/utaipan/data/20dd7903d/37bc3ac4f5494625ae41a906645c74a4 [2018-12-09 01:34:10,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:34:10,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:34:10,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:34:10,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:34:10,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:34:10,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:34:10" (1/1) ... [2018-12-09 01:34:10,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c700c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:34:10, skipping insertion in model container [2018-12-09 01:34:10,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:34:10" (1/1) ... [2018-12-09 01:34:10,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:34:10,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:34:10,788 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:34:10,800 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:34:10,892 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:34:10,893 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 01:34:10,895 INFO L168 Benchmark]: Toolchain (without parser) took 353.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:34:10,896 INFO L168 Benchmark]: CDTParser took 0.13 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 01:34:10,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:34:10,898 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.13 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 352.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 40.6 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...