./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/s3_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdf0cf9bd7de1f69825d4535f203da45c4edbbfc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:18:27,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:18:27,814 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:18:27,821 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:18:27,821 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:18:27,822 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:18:27,823 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:18:27,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:18:27,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:18:27,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:18:27,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:18:27,826 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:18:27,827 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:18:27,828 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:18:27,828 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:18:27,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:18:27,830 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:18:27,831 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:18:27,832 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:18:27,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:18:27,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:18:27,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:18:27,837 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:18:27,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:18:27,837 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:18:27,838 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:18:27,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:18:27,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:18:27,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:18:27,840 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:18:27,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:18:27,841 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:18:27,841 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:18:27,841 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:18:27,842 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:18:27,842 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:18:27,843 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 01:18:27,852 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:18:27,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:18:27,853 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:18:27,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 01:18:27,854 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:18:27,854 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:18:27,854 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:18:27,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:18:27,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:18:27,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:18:27,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:18:27,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:18:27,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:18:27,856 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:18:27,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:18:27,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:18:27,856 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:18:27,856 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:18:27,857 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:18:27,857 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:18:27,857 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:18:27,857 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:18:27,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:18:27,857 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_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-10 01:18:27,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:18:27,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:18:27,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:18:27,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:18:27,889 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:18:27,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-10 01:18:27,930 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/373131a97/c733822875414e35a135c58386f719d3/FLAG1161ce38e [2018-11-10 01:18:28,289 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:18:28,289 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-10 01:18:28,297 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/373131a97/c733822875414e35a135c58386f719d3/FLAG1161ce38e [2018-11-10 01:18:28,305 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/373131a97/c733822875414e35a135c58386f719d3 [2018-11-10 01:18:28,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:18:28,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:18:28,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:18:28,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:18:28,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:18:28,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:18:28" (1/1) ... [2018-11-10 01:18:28,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:28, skipping insertion in model container [2018-11-10 01:18:28,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:18:28" (1/1) ... [2018-11-10 01:18:28,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:18:28,357 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:18:28,761 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:18:28,770 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:18:29,000 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:18:29,015 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:18:29,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29 WrapperNode [2018-11-10 01:18:29,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:18:29,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:18:29,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:18:29,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:18:29,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... [2018-11-10 01:18:29,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:18:29,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:18:29,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:18:29,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:18:29,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-10 01:18:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 01:18:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-10 01:18:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:18:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 01:18:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 01:18:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:18:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 01:18:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:18:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 01:18:29,480 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:18:29,480 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:18:29,912 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:18:29,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:29 BoogieIcfgContainer [2018-11-10 01:18:29,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:18:29,913 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:18:29,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:18:29,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:18:29,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:18:28" (1/3) ... [2018-11-10 01:18:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b24ce75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:18:29, skipping insertion in model container [2018-11-10 01:18:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:29" (2/3) ... [2018-11-10 01:18:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b24ce75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:18:29, skipping insertion in model container [2018-11-10 01:18:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:29" (3/3) ... [2018-11-10 01:18:29,918 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-10 01:18:29,923 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:18:29,929 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:18:29,938 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:18:29,959 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:18:29,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:18:29,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:18:29,960 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:18:29,960 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:18:29,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:18:29,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:18:29,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:18:29,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:18:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2018-11-10 01:18:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 01:18:29,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:29,985 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:29,987 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:29,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1847479421, now seen corresponding path program 1 times [2018-11-10 01:18:29,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:29,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:30,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:30,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:30,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:30,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:30,255 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2018-11-10 01:18:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:30,360 INFO L93 Difference]: Finished difference Result 908 states and 1160 transitions. [2018-11-10 01:18:30,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:30,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-11-10 01:18:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:30,375 INFO L225 Difference]: With dead ends: 908 [2018-11-10 01:18:30,375 INFO L226 Difference]: Without dead ends: 556 [2018-11-10 01:18:30,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-11-10 01:18:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2018-11-10 01:18:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-11-10 01:18:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 660 transitions. [2018-11-10 01:18:30,433 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 660 transitions. Word has length 94 [2018-11-10 01:18:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:30,434 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 660 transitions. [2018-11-10 01:18:30,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 660 transitions. [2018-11-10 01:18:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 01:18:30,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:30,437 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:30,438 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:30,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:30,438 INFO L82 PathProgramCache]: Analyzing trace with hash 791639565, now seen corresponding path program 1 times [2018-11-10 01:18:30,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:30,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:30,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:30,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:30,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:30,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:30,593 INFO L87 Difference]: Start difference. First operand 556 states and 660 transitions. Second operand 4 states. [2018-11-10 01:18:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:30,807 INFO L93 Difference]: Finished difference Result 866 states and 1041 transitions. [2018-11-10 01:18:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:30,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-10 01:18:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:30,810 INFO L225 Difference]: With dead ends: 866 [2018-11-10 01:18:30,810 INFO L226 Difference]: Without dead ends: 617 [2018-11-10 01:18:30,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:30,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-11-10 01:18:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 587. [2018-11-10 01:18:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-11-10 01:18:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2018-11-10 01:18:30,832 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 123 [2018-11-10 01:18:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:30,832 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2018-11-10 01:18:30,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2018-11-10 01:18:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 01:18:30,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:30,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:30,836 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:30,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1991759122, now seen corresponding path program 1 times [2018-11-10 01:18:30,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:30,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:30,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:30,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:30,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:18:30,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:18:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:18:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:18:30,959 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2018-11-10 01:18:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:31,382 INFO L93 Difference]: Finished difference Result 1226 states and 1490 transitions. [2018-11-10 01:18:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:31,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-10 01:18:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:31,385 INFO L225 Difference]: With dead ends: 1226 [2018-11-10 01:18:31,385 INFO L226 Difference]: Without dead ends: 946 [2018-11-10 01:18:31,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:18:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-11-10 01:18:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 591. [2018-11-10 01:18:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-11-10 01:18:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2018-11-10 01:18:31,399 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 133 [2018-11-10 01:18:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:31,399 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2018-11-10 01:18:31,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:18:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2018-11-10 01:18:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 01:18:31,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:31,401 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:31,401 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:31,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1714735240, now seen corresponding path program 1 times [2018-11-10 01:18:31,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:31,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:31,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:31,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:31,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:31,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:31,489 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 4 states. [2018-11-10 01:18:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:31,631 INFO L93 Difference]: Finished difference Result 923 states and 1116 transitions. [2018-11-10 01:18:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:31,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-11-10 01:18:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:31,633 INFO L225 Difference]: With dead ends: 923 [2018-11-10 01:18:31,633 INFO L226 Difference]: Without dead ends: 639 [2018-11-10 01:18:31,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-10 01:18:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 600. [2018-11-10 01:18:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 01:18:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 717 transitions. [2018-11-10 01:18:31,643 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 717 transitions. Word has length 151 [2018-11-10 01:18:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:31,643 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 717 transitions. [2018-11-10 01:18:31,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 717 transitions. [2018-11-10 01:18:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 01:18:31,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:31,645 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:31,645 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:31,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1993983011, now seen corresponding path program 1 times [2018-11-10 01:18:31,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:31,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:31,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:31,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:31,725 INFO L87 Difference]: Start difference. First operand 600 states and 717 transitions. Second operand 4 states. [2018-11-10 01:18:31,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:31,866 INFO L93 Difference]: Finished difference Result 932 states and 1125 transitions. [2018-11-10 01:18:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:31,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-10 01:18:31,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:31,868 INFO L225 Difference]: With dead ends: 932 [2018-11-10 01:18:31,868 INFO L226 Difference]: Without dead ends: 639 [2018-11-10 01:18:31,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-10 01:18:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 602. [2018-11-10 01:18:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 01:18:31,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 719 transitions. [2018-11-10 01:18:31,877 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 719 transitions. Word has length 153 [2018-11-10 01:18:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:31,878 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 719 transitions. [2018-11-10 01:18:31,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 719 transitions. [2018-11-10 01:18:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 01:18:31,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:31,879 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-11-10 01:18:31,879 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1728140825, now seen corresponding path program 1 times [2018-11-10 01:18:31,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 01:18:31,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:31,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:31,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:31,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:31,939 INFO L87 Difference]: Start difference. First operand 602 states and 719 transitions. Second operand 3 states. [2018-11-10 01:18:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:31,962 INFO L93 Difference]: Finished difference Result 1190 states and 1440 transitions. [2018-11-10 01:18:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:31,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-10 01:18:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:31,964 INFO L225 Difference]: With dead ends: 1190 [2018-11-10 01:18:31,964 INFO L226 Difference]: Without dead ends: 895 [2018-11-10 01:18:31,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:31,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-11-10 01:18:31,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2018-11-10 01:18:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-11-10 01:18:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1076 transitions. [2018-11-10 01:18:31,977 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1076 transitions. Word has length 154 [2018-11-10 01:18:31,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:31,977 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1076 transitions. [2018-11-10 01:18:31,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1076 transitions. [2018-11-10 01:18:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 01:18:31,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:31,980 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:31,980 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:31,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1267260258, now seen corresponding path program 1 times [2018-11-10 01:18:31,980 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 01:18:32,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:32,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:32,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:32,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:32,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:32,061 INFO L87 Difference]: Start difference. First operand 895 states and 1076 transitions. Second operand 3 states. [2018-11-10 01:18:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:32,099 INFO L93 Difference]: Finished difference Result 1190 states and 1437 transitions. [2018-11-10 01:18:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:32,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-10 01:18:32,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:32,102 INFO L225 Difference]: With dead ends: 1190 [2018-11-10 01:18:32,102 INFO L226 Difference]: Without dead ends: 1188 [2018-11-10 01:18:32,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-11-10 01:18:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2018-11-10 01:18:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2018-11-10 01:18:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1434 transitions. [2018-11-10 01:18:32,119 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1434 transitions. Word has length 190 [2018-11-10 01:18:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:32,119 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1434 transitions. [2018-11-10 01:18:32,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1434 transitions. [2018-11-10 01:18:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 01:18:32,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:32,122 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:32,122 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:32,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1753490078, now seen corresponding path program 1 times [2018-11-10 01:18:32,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:32,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:32,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:32,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:32,208 INFO L87 Difference]: Start difference. First operand 1188 states and 1434 transitions. Second operand 3 states. [2018-11-10 01:18:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:32,231 INFO L93 Difference]: Finished difference Result 2062 states and 2502 transitions. [2018-11-10 01:18:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:32,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-11-10 01:18:32,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:32,234 INFO L225 Difference]: With dead ends: 2062 [2018-11-10 01:18:32,234 INFO L226 Difference]: Without dead ends: 1181 [2018-11-10 01:18:32,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-11-10 01:18:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2018-11-10 01:18:32,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-10 01:18:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1420 transitions. [2018-11-10 01:18:32,249 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1420 transitions. Word has length 229 [2018-11-10 01:18:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:32,249 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1420 transitions. [2018-11-10 01:18:32,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1420 transitions. [2018-11-10 01:18:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 01:18:32,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:32,252 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:32,252 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:32,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash -466598124, now seen corresponding path program 1 times [2018-11-10 01:18:32,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:32,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:32,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:32,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:32,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:32,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:32,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:32,344 INFO L87 Difference]: Start difference. First operand 1181 states and 1420 transitions. Second operand 4 states. [2018-11-10 01:18:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:32,509 INFO L93 Difference]: Finished difference Result 2646 states and 3219 transitions. [2018-11-10 01:18:32,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:32,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-11-10 01:18:32,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:32,513 INFO L225 Difference]: With dead ends: 2646 [2018-11-10 01:18:32,513 INFO L226 Difference]: Without dead ends: 1531 [2018-11-10 01:18:32,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-11-10 01:18:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1353. [2018-11-10 01:18:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-11-10 01:18:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1664 transitions. [2018-11-10 01:18:32,533 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1664 transitions. Word has length 233 [2018-11-10 01:18:32,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:32,534 INFO L481 AbstractCegarLoop]: Abstraction has 1353 states and 1664 transitions. [2018-11-10 01:18:32,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1664 transitions. [2018-11-10 01:18:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 01:18:32,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:32,536 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:32,536 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash 446462553, now seen corresponding path program 1 times [2018-11-10 01:18:32,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:32,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:32,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:32,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:32,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:32,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:18:32,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:18:32,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:18:32,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:18:32,648 INFO L87 Difference]: Start difference. First operand 1353 states and 1664 transitions. Second operand 6 states. [2018-11-10 01:18:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:33,039 INFO L93 Difference]: Finished difference Result 4368 states and 5386 transitions. [2018-11-10 01:18:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:33,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2018-11-10 01:18:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:33,047 INFO L225 Difference]: With dead ends: 4368 [2018-11-10 01:18:33,047 INFO L226 Difference]: Without dead ends: 3081 [2018-11-10 01:18:33,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:18:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-11-10 01:18:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 1369. [2018-11-10 01:18:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-10 01:18:33,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1680 transitions. [2018-11-10 01:18:33,084 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1680 transitions. Word has length 243 [2018-11-10 01:18:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:33,085 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 1680 transitions. [2018-11-10 01:18:33,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:18:33,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1680 transitions. [2018-11-10 01:18:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 01:18:33,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:33,088 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:33,088 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:33,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash -826404721, now seen corresponding path program 1 times [2018-11-10 01:18:33,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:33,207 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 01:18:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:33,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:33,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:33,208 INFO L87 Difference]: Start difference. First operand 1369 states and 1680 transitions. Second operand 4 states. [2018-11-10 01:18:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:33,529 INFO L93 Difference]: Finished difference Result 3350 states and 4149 transitions. [2018-11-10 01:18:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:33,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-10 01:18:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:33,535 INFO L225 Difference]: With dead ends: 3350 [2018-11-10 01:18:33,536 INFO L226 Difference]: Without dead ends: 2047 [2018-11-10 01:18:33,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-11-10 01:18:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1513. [2018-11-10 01:18:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-11-10 01:18:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1880 transitions. [2018-11-10 01:18:33,582 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1880 transitions. Word has length 261 [2018-11-10 01:18:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:33,582 INFO L481 AbstractCegarLoop]: Abstraction has 1513 states and 1880 transitions. [2018-11-10 01:18:33,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1880 transitions. [2018-11-10 01:18:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 01:18:33,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:33,588 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:33,588 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:33,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash -644582353, now seen corresponding path program 1 times [2018-11-10 01:18:33,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:33,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:33,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:33,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:33,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:33,684 INFO L87 Difference]: Start difference. First operand 1513 states and 1880 transitions. Second operand 4 states. [2018-11-10 01:18:33,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:33,871 INFO L93 Difference]: Finished difference Result 3258 states and 4063 transitions. [2018-11-10 01:18:33,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:33,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-11-10 01:18:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:33,876 INFO L225 Difference]: With dead ends: 3258 [2018-11-10 01:18:33,876 INFO L226 Difference]: Without dead ends: 1811 [2018-11-10 01:18:33,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-10 01:18:33,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1549. [2018-11-10 01:18:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-11-10 01:18:33,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1920 transitions. [2018-11-10 01:18:33,902 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1920 transitions. Word has length 261 [2018-11-10 01:18:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:33,902 INFO L481 AbstractCegarLoop]: Abstraction has 1549 states and 1920 transitions. [2018-11-10 01:18:33,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1920 transitions. [2018-11-10 01:18:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 01:18:33,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:33,905 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:33,905 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:33,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 416932362, now seen corresponding path program 1 times [2018-11-10 01:18:33,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:33,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:33,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:33,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:33,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:33,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:33,983 INFO L87 Difference]: Start difference. First operand 1549 states and 1920 transitions. Second operand 4 states. [2018-11-10 01:18:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:34,160 INFO L93 Difference]: Finished difference Result 3294 states and 4099 transitions. [2018-11-10 01:18:34,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:34,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-11-10 01:18:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:34,164 INFO L225 Difference]: With dead ends: 3294 [2018-11-10 01:18:34,164 INFO L226 Difference]: Without dead ends: 1811 [2018-11-10 01:18:34,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-11-10 01:18:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1557. [2018-11-10 01:18:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2018-11-10 01:18:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1928 transitions. [2018-11-10 01:18:34,189 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1928 transitions. Word has length 263 [2018-11-10 01:18:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:34,190 INFO L481 AbstractCegarLoop]: Abstraction has 1557 states and 1928 transitions. [2018-11-10 01:18:34,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1928 transitions. [2018-11-10 01:18:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 01:18:34,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:34,193 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:34,193 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:34,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -608866290, now seen corresponding path program 1 times [2018-11-10 01:18:34,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 249 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 01:18:34,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:18:34,306 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:18:34,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:34,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:34,438 INFO L477 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-11-10 01:18:34,440 INFO L477 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-11-10 01:18:34,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 01:18:34,460 INFO L477 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-11-10 01:18:34,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:34,463 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:34,464 INFO L477 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-11-10 01:18:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 01:18:34,487 INFO L477 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-11-10 01:18:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:34,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:34,492 INFO L477 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-11-10 01:18:34,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:34,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-11-10 01:18:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:18:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-10 01:18:34,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:18:34,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:18:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:18:34,552 INFO L87 Difference]: Start difference. First operand 1557 states and 1928 transitions. Second operand 8 states. [2018-11-10 01:18:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:35,322 INFO L93 Difference]: Finished difference Result 4791 states and 5958 transitions. [2018-11-10 01:18:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 01:18:35,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 264 [2018-11-10 01:18:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:35,328 INFO L225 Difference]: With dead ends: 4791 [2018-11-10 01:18:35,328 INFO L226 Difference]: Without dead ends: 3300 [2018-11-10 01:18:35,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:18:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2018-11-10 01:18:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2740. [2018-11-10 01:18:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-11-10 01:18:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3435 transitions. [2018-11-10 01:18:35,385 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3435 transitions. Word has length 264 [2018-11-10 01:18:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:35,385 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3435 transitions. [2018-11-10 01:18:35,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:18:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3435 transitions. [2018-11-10 01:18:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 01:18:35,389 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:35,389 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:35,389 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:35,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1210095665, now seen corresponding path program 1 times [2018-11-10 01:18:35,390 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:35,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:35,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:35,518 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:35,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:35,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:35,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:35,519 INFO L87 Difference]: Start difference. First operand 2740 states and 3435 transitions. Second operand 4 states. [2018-11-10 01:18:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:35,807 INFO L93 Difference]: Finished difference Result 5766 states and 7226 transitions. [2018-11-10 01:18:35,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:35,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-11-10 01:18:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:35,817 INFO L225 Difference]: With dead ends: 5766 [2018-11-10 01:18:35,817 INFO L226 Difference]: Without dead ends: 3092 [2018-11-10 01:18:35,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2018-11-10 01:18:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2740. [2018-11-10 01:18:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-11-10 01:18:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3427 transitions. [2018-11-10 01:18:35,895 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3427 transitions. Word has length 265 [2018-11-10 01:18:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:35,896 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3427 transitions. [2018-11-10 01:18:35,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3427 transitions. [2018-11-10 01:18:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 01:18:35,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:35,901 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:35,901 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:35,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:35,902 INFO L82 PathProgramCache]: Analyzing trace with hash 525585509, now seen corresponding path program 1 times [2018-11-10 01:18:35,902 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:35,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:35,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:35,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:36,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:36,005 INFO L87 Difference]: Start difference. First operand 2740 states and 3427 transitions. Second operand 4 states. [2018-11-10 01:18:36,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:36,201 INFO L93 Difference]: Finished difference Result 5766 states and 7210 transitions. [2018-11-10 01:18:36,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:36,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-11-10 01:18:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:36,207 INFO L225 Difference]: With dead ends: 5766 [2018-11-10 01:18:36,207 INFO L226 Difference]: Without dead ends: 3092 [2018-11-10 01:18:36,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2018-11-10 01:18:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2740. [2018-11-10 01:18:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-11-10 01:18:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3419 transitions. [2018-11-10 01:18:36,254 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3419 transitions. Word has length 265 [2018-11-10 01:18:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:36,255 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3419 transitions. [2018-11-10 01:18:36,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3419 transitions. [2018-11-10 01:18:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-11-10 01:18:36,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:36,259 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:36,259 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:36,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -339905229, now seen corresponding path program 1 times [2018-11-10 01:18:36,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:36,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:36,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:36,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:36,344 INFO L87 Difference]: Start difference. First operand 2740 states and 3419 transitions. Second operand 4 states. [2018-11-10 01:18:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:36,527 INFO L93 Difference]: Finished difference Result 5718 states and 7138 transitions. [2018-11-10 01:18:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:36,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-11-10 01:18:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:36,536 INFO L225 Difference]: With dead ends: 5718 [2018-11-10 01:18:36,536 INFO L226 Difference]: Without dead ends: 3044 [2018-11-10 01:18:36,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:36,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-11-10 01:18:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2756. [2018-11-10 01:18:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-11-10 01:18:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3435 transitions. [2018-11-10 01:18:36,583 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3435 transitions. Word has length 266 [2018-11-10 01:18:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:36,584 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 3435 transitions. [2018-11-10 01:18:36,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3435 transitions. [2018-11-10 01:18:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 01:18:36,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:36,587 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:36,588 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:36,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:36,588 INFO L82 PathProgramCache]: Analyzing trace with hash -237694144, now seen corresponding path program 1 times [2018-11-10 01:18:36,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:36,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:36,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:36,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:36,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:36,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:36,690 INFO L87 Difference]: Start difference. First operand 2756 states and 3435 transitions. Second operand 4 states. [2018-11-10 01:18:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:36,884 INFO L93 Difference]: Finished difference Result 5682 states and 7086 transitions. [2018-11-10 01:18:36,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:36,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-10 01:18:36,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:36,891 INFO L225 Difference]: With dead ends: 5682 [2018-11-10 01:18:36,891 INFO L226 Difference]: Without dead ends: 2992 [2018-11-10 01:18:36,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-11-10 01:18:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2756. [2018-11-10 01:18:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-11-10 01:18:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3427 transitions. [2018-11-10 01:18:36,939 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3427 transitions. Word has length 267 [2018-11-10 01:18:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:36,939 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 3427 transitions. [2018-11-10 01:18:36,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3427 transitions. [2018-11-10 01:18:36,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 01:18:36,943 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:36,943 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:36,943 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:36,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1771055957, now seen corresponding path program 1 times [2018-11-10 01:18:36,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:36,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:36,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:37,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:37,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:37,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:37,024 INFO L87 Difference]: Start difference. First operand 2756 states and 3427 transitions. Second operand 4 states. [2018-11-10 01:18:37,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:37,202 INFO L93 Difference]: Finished difference Result 5682 states and 7070 transitions. [2018-11-10 01:18:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:37,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-10 01:18:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:37,208 INFO L225 Difference]: With dead ends: 5682 [2018-11-10 01:18:37,208 INFO L226 Difference]: Without dead ends: 2992 [2018-11-10 01:18:37,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-11-10 01:18:37,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2772. [2018-11-10 01:18:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-11-10 01:18:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3443 transitions. [2018-11-10 01:18:37,255 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3443 transitions. Word has length 267 [2018-11-10 01:18:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:37,255 INFO L481 AbstractCegarLoop]: Abstraction has 2772 states and 3443 transitions. [2018-11-10 01:18:37,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3443 transitions. [2018-11-10 01:18:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 01:18:37,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:37,259 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:37,259 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:37,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:37,260 INFO L82 PathProgramCache]: Analyzing trace with hash -191724816, now seen corresponding path program 1 times [2018-11-10 01:18:37,260 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:37,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:37,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:37,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:37,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:37,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:37,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:18:37,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 01:18:37,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:18:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:18:37,339 INFO L87 Difference]: Start difference. First operand 2772 states and 3443 transitions. Second operand 4 states. [2018-11-10 01:18:37,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:37,507 INFO L93 Difference]: Finished difference Result 5642 states and 7010 transitions. [2018-11-10 01:18:37,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:18:37,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-11-10 01:18:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:37,512 INFO L225 Difference]: With dead ends: 5642 [2018-11-10 01:18:37,512 INFO L226 Difference]: Without dead ends: 2936 [2018-11-10 01:18:37,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-11-10 01:18:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2018-11-10 01:18:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2788. [2018-11-10 01:18:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-11-10 01:18:37,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3459 transitions. [2018-11-10 01:18:37,555 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3459 transitions. Word has length 269 [2018-11-10 01:18:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:37,555 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3459 transitions. [2018-11-10 01:18:37,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 01:18:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3459 transitions. [2018-11-10 01:18:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-10 01:18:37,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:37,559 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:37,559 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash -274811404, now seen corresponding path program 1 times [2018-11-10 01:18:37,560 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:37,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:18:37,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:18:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:18:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:18:37,673 INFO L87 Difference]: Start difference. First operand 2788 states and 3459 transitions. Second operand 6 states. [2018-11-10 01:18:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:38,167 INFO L93 Difference]: Finished difference Result 8270 states and 10209 transitions. [2018-11-10 01:18:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:38,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2018-11-10 01:18:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:38,174 INFO L225 Difference]: With dead ends: 8270 [2018-11-10 01:18:38,174 INFO L226 Difference]: Without dead ends: 5548 [2018-11-10 01:18:38,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:18:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-11-10 01:18:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 2788. [2018-11-10 01:18:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-11-10 01:18:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3451 transitions. [2018-11-10 01:18:38,235 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3451 transitions. Word has length 271 [2018-11-10 01:18:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:38,236 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3451 transitions. [2018-11-10 01:18:38,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:18:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3451 transitions. [2018-11-10 01:18:38,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-11-10 01:18:38,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:38,240 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:38,241 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:38,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:38,241 INFO L82 PathProgramCache]: Analyzing trace with hash -715471217, now seen corresponding path program 1 times [2018-11-10 01:18:38,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:38,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:38,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:38,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:38,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 01:18:38,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:18:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:18:38,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:18:38,352 INFO L87 Difference]: Start difference. First operand 2788 states and 3451 transitions. Second operand 6 states. [2018-11-10 01:18:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:38,863 INFO L93 Difference]: Finished difference Result 8270 states and 10193 transitions. [2018-11-10 01:18:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:38,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2018-11-10 01:18:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:38,870 INFO L225 Difference]: With dead ends: 8270 [2018-11-10 01:18:38,870 INFO L226 Difference]: Without dead ends: 5548 [2018-11-10 01:18:38,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 01:18:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-11-10 01:18:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 2788. [2018-11-10 01:18:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-11-10 01:18:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3443 transitions. [2018-11-10 01:18:38,926 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3443 transitions. Word has length 273 [2018-11-10 01:18:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:38,926 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3443 transitions. [2018-11-10 01:18:38,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:18:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3443 transitions. [2018-11-10 01:18:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 01:18:38,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:38,930 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:38,931 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:38,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1564135183, now seen corresponding path program 1 times [2018-11-10 01:18:38,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:38,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:38,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:38,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-11-10 01:18:39,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:39,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 01:18:39,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:18:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:18:39,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:18:39,152 INFO L87 Difference]: Start difference. First operand 2788 states and 3443 transitions. Second operand 11 states. [2018-11-10 01:18:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:39,627 INFO L93 Difference]: Finished difference Result 5518 states and 6825 transitions. [2018-11-10 01:18:39,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:18:39,628 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2018-11-10 01:18:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:39,631 INFO L225 Difference]: With dead ends: 5518 [2018-11-10 01:18:39,631 INFO L226 Difference]: Without dead ends: 2796 [2018-11-10 01:18:39,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-10 01:18:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-11-10 01:18:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2794. [2018-11-10 01:18:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2018-11-10 01:18:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3449 transitions. [2018-11-10 01:18:39,676 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3449 transitions. Word has length 274 [2018-11-10 01:18:39,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:39,676 INFO L481 AbstractCegarLoop]: Abstraction has 2794 states and 3449 transitions. [2018-11-10 01:18:39,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:18:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3449 transitions. [2018-11-10 01:18:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-10 01:18:39,705 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:39,705 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:39,705 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:39,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1512696722, now seen corresponding path program 1 times [2018-11-10 01:18:39,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:18:39,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:18:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:39,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:39,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:18:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:18:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:18:39,972 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:18:40,012 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 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-11-10 01:18:40,013 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20490 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-11-10 01:18:40,013 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20490 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-11-10 01:18:40,013 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20484 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-11-10 01:18:40,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:18:40 BoogieIcfgContainer [2018-11-10 01:18:40,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:18:40,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:18:40,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:18:40,069 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:18:40,069 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:29" (3/4) ... [2018-11-10 01:18:40,072 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 01:18:40,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:18:40,073 INFO L168 Benchmark]: Toolchain (without parser) took 11765.97 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 687.9 MB). Free memory was 956.5 MB in the beginning and 1.6 GB in the end (delta: -600.0 MB). Peak memory consumption was 87.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:18:40,074 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:18:40,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.5 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. [2018-11-10 01:18:40,075 INFO L168 Benchmark]: Boogie Preprocessor took 71.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:18:40,075 INFO L168 Benchmark]: RCFGBuilder took 825.23 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:18:40,076 INFO L168 Benchmark]: TraceAbstraction took 10154.53 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 518.5 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -508.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:18:40,076 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.7 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:18:40,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 707.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 956.5 MB in the beginning and 1.2 GB in the end (delta: -197.1 MB). Peak memory consumption was 170.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 825.23 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: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10154.53 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 518.5 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -508.4 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.7 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20484 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 20490 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 20490 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 20484 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; VAL [\old(init)=20487, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20490:20484}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20487, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20492:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={20492:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, SSLv3_client_data={20492:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20494:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20494:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1069] FCALL s->state = 12292 VAL [init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20494:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, init=1, malloc (sizeof (SSL))={20482:0}, malloc(sizeof(SSL_CTX))={20494:0}, malloc(sizeof(struct ssl3_state_st))={20495:0}, s={20482:0}, SSLv3_client_data={20492:0}] [L1071] CALL ssl3_connect(s) VAL [init=1, s={20482:0}, SSLv3_client_data={20492:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 VAL [blastFlag=0, buf={20493:20491}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20492:0}, tmp___1=0, tmp___2=0] [L1101] FCALL s->state = 12292 VAL [blastFlag=0, buf={20493:20491}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20492:0}, tmp___1=0, tmp___2=0] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, blastFlag=0, buf={20493:20491}, init=1, s={20482:0}, s={20482:0}, SSLv3_client_data={20492:0}, tmp___1=0, tmp___2=0] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1109] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1110] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->info_callback={9:-8}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->info_callback={9:-8}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1119] FCALL s->in_handshake += 1 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->in_handshake=1, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1120] COND FALSE !(tmp___1 & 12288) VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=12292, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=12292, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1237] FCALL s->state = 4096 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL s->ctx VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={9:-8}, (s->ctx)->stats.sess_connect_renegotiate=-6, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={9:-8}, (s->ctx)->stats.sess_connect_renegotiate=-6, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1243] FCALL s->server = 0 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1249] EXPR, FCALL s->version VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->version=-5, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1256] EXPR, FCALL s->init_buf VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1282] FCALL s->state = 4368 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL s->ctx VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [={9:-8}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [={9:-8}, (s->ctx)->stats.sess_connect=1, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->ctx={20494:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [={9:-8}, blastFlag=0, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=-1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1300] FCALL s->state = 4384 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1301] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->bbio VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->bbio={1:1}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->wbio VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->bbio={1:1}, s->wbio={1:2}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=1, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=15, s={20482:0}, s={20482:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] FCALL s->hit VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->hit=0, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [={9:-8}, (s->s3)->tmp.new_cipher={20483:1}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={9:-8}, ((s->s3)->tmp.new_cipher)->algorithms=20486, (s->s3)->tmp.new_cipher={20483:1}, blastFlag=2, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] FCALL s->state = 4416 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=3, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1361] FCALL s->state = 4432 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=10, s={20482:0}, s={20482:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1384] FCALL s->state = 4448 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1385] FCALL s->init_num = 0 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={9:-8}, (s->s3)->tmp.reuse_message=20489, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=1, s={20482:0}, s={20482:0}, s->state=4448, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={9:-8}, blastFlag=4, buf={20493:20491}, init=1, malloc(sizeof(int))={20488:0}, ret=0, s={20482:0}, s={20482:0}, skip=0, SSLv3_client_data={20492:0}, state=4448, tmp=0, tmp___0={20488:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 385 locations, 1 error locations. UNSAFE Result, 10.1s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 6.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11178 SDtfs, 4836 SDslu, 21956 SDs, 0 SdLazy, 7671 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 346 SyntacticMatches, 42 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2794occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 11079 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 5739 NumberOfCodeBlocks, 5739 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 5409 ConstructedInterpolants, 0 QuantifiedInterpolants, 2556252 SizeOfPredicates, 3 NumberOfNonLiveVariables, 582 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 5364/5365 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-1dbac8b [2018-11-10 01:18:41,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:18:41,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:18:41,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:18:41,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:18:41,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:18:41,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:18:41,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:18:41,501 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:18:41,501 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:18:41,502 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:18:41,502 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:18:41,503 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:18:41,504 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:18:41,505 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:18:41,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:18:41,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:18:41,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:18:41,509 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:18:41,510 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:18:41,511 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:18:41,512 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:18:41,514 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:18:41,514 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:18:41,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:18:41,516 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:18:41,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:18:41,517 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:18:41,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:18:41,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:18:41,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:18:41,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:18:41,520 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:18:41,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:18:41,520 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:18:41,521 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:18:41,521 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-10 01:18:41,532 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:18:41,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:18:41,533 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:18:41,533 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 01:18:41,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:18:41,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:18:41,534 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:18:41,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:18:41,535 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:18:41,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 01:18:41,536 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:18:41,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:18:41,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:18:41,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 01:18:41,538 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 01:18:41,539 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_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-10 01:18:41,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:18:41,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:18:41,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:18:41,580 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:18:41,580 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:18:41,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-10 01:18:41,615 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/e6d9cf1eb/b48e3d3c195a4064aff974dc73dd5553/FLAGb75827d6d [2018-11-10 01:18:41,973 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:18:41,974 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-10 01:18:41,984 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/e6d9cf1eb/b48e3d3c195a4064aff974dc73dd5553/FLAGb75827d6d [2018-11-10 01:18:41,991 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/data/e6d9cf1eb/b48e3d3c195a4064aff974dc73dd5553 [2018-11-10 01:18:41,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:18:41,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 01:18:41,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:18:41,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:18:41,997 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:18:41,998 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:18:41" (1/1) ... [2018-11-10 01:18:41,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea4c67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:41, skipping insertion in model container [2018-11-10 01:18:41,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:18:41" (1/1) ... [2018-11-10 01:18:42,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:18:42,042 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:18:42,435 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:18:42,444 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:18:42,647 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:18:42,658 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:18:42,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42 WrapperNode [2018-11-10 01:18:42,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:18:42,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:18:42,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:18:42,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:18:42,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... [2018-11-10 01:18:42,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:18:42,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:18:42,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:18:42,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:18:42,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:18:42,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:18:42,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:18:42,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-11-10 01:18:42,835 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-11-10 01:18:42,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:18:42,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 01:18:42,836 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-11-10 01:18:42,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-10 01:18:42,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 01:18:42,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 01:18:42,836 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 01:18:42,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 01:18:42,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:18:42,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:18:42,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 01:18:43,200 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 01:18:43,200 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 01:18:43,721 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:18:43,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:43 BoogieIcfgContainer [2018-11-10 01:18:43,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:18:43,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:18:43,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:18:43,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:18:43,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:18:41" (1/3) ... [2018-11-10 01:18:43,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f389cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:18:43, skipping insertion in model container [2018-11-10 01:18:43,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:18:42" (2/3) ... [2018-11-10 01:18:43,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f389cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:18:43, skipping insertion in model container [2018-11-10 01:18:43,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:43" (3/3) ... [2018-11-10 01:18:43,727 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-10 01:18:43,733 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:18:43,738 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 01:18:43,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 01:18:43,769 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:18:43,769 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:18:43,769 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:18:43,769 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:18:43,769 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:18:43,769 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:18:43,770 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:18:43,770 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:18:43,770 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:18:43,786 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2018-11-10 01:18:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 01:18:43,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:43,794 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:43,796 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:43,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1216953019, now seen corresponding path program 1 times [2018-11-10 01:18:43,804 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:43,804 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:43,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:43,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:43,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:43,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:43,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:43,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:43,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:43,964 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 3 states. [2018-11-10 01:18:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:44,038 INFO L93 Difference]: Finished difference Result 906 states and 1158 transitions. [2018-11-10 01:18:44,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:44,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-11-10 01:18:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:44,053 INFO L225 Difference]: With dead ends: 906 [2018-11-10 01:18:44,053 INFO L226 Difference]: Without dead ends: 554 [2018-11-10 01:18:44,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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-11-10 01:18:44,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-10 01:18:44,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-11-10 01:18:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-11-10 01:18:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 658 transitions. [2018-11-10 01:18:44,101 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 658 transitions. Word has length 92 [2018-11-10 01:18:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:44,101 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 658 transitions. [2018-11-10 01:18:44,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 658 transitions. [2018-11-10 01:18:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 01:18:44,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:44,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:44,104 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:44,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1653274051, now seen corresponding path program 1 times [2018-11-10 01:18:44,105 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:44,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:44,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:18:44,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:44,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:44,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:44,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:44,216 INFO L87 Difference]: Start difference. First operand 554 states and 658 transitions. Second operand 3 states. [2018-11-10 01:18:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:44,276 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2018-11-10 01:18:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:44,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-10 01:18:44,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:44,279 INFO L225 Difference]: With dead ends: 1044 [2018-11-10 01:18:44,279 INFO L226 Difference]: Without dead ends: 795 [2018-11-10 01:18:44,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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-11-10 01:18:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-11-10 01:18:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2018-11-10 01:18:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-11-10 01:18:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 946 transitions. [2018-11-10 01:18:44,302 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 946 transitions. Word has length 121 [2018-11-10 01:18:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:44,303 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 946 transitions. [2018-11-10 01:18:44,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 946 transitions. [2018-11-10 01:18:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 01:18:44,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:44,307 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:18:44,307 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:44,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:44,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1217351889, now seen corresponding path program 1 times [2018-11-10 01:18:44,309 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:44,309 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:44,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:44,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 01:18:44,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:44,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:44,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:44,441 INFO L87 Difference]: Start difference. First operand 795 states and 946 transitions. Second operand 3 states. [2018-11-10 01:18:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:44,488 INFO L93 Difference]: Finished difference Result 1531 states and 1836 transitions. [2018-11-10 01:18:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:44,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-11-10 01:18:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:44,491 INFO L225 Difference]: With dead ends: 1531 [2018-11-10 01:18:44,491 INFO L226 Difference]: Without dead ends: 1041 [2018-11-10 01:18:44,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-11-10 01:18:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-11-10 01:18:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2018-11-10 01:18:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-10 01:18:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1240 transitions. [2018-11-10 01:18:44,509 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1240 transitions. Word has length 152 [2018-11-10 01:18:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:44,509 INFO L481 AbstractCegarLoop]: Abstraction has 1041 states and 1240 transitions. [2018-11-10 01:18:44,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1240 transitions. [2018-11-10 01:18:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 01:18:44,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:44,512 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:44,512 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:44,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:44,513 INFO L82 PathProgramCache]: Analyzing trace with hash -823217818, now seen corresponding path program 1 times [2018-11-10 01:18:44,513 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:44,513 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:44,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 01:18:44,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:44,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:44,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:44,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:44,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:44,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:44,660 INFO L87 Difference]: Start difference. First operand 1041 states and 1240 transitions. Second operand 3 states. [2018-11-10 01:18:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:44,707 INFO L93 Difference]: Finished difference Result 2019 states and 2420 transitions. [2018-11-10 01:18:44,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:44,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-11-10 01:18:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:44,710 INFO L225 Difference]: With dead ends: 2019 [2018-11-10 01:18:44,710 INFO L226 Difference]: Without dead ends: 1283 [2018-11-10 01:18:44,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 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-11-10 01:18:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2018-11-10 01:18:44,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2018-11-10 01:18:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-11-10 01:18:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1530 transitions. [2018-11-10 01:18:44,727 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1530 transitions. Word has length 188 [2018-11-10 01:18:44,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:44,728 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1530 transitions. [2018-11-10 01:18:44,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1530 transitions. [2018-11-10 01:18:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 01:18:44,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:44,730 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:44,730 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:44,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:44,730 INFO L82 PathProgramCache]: Analyzing trace with hash -133889644, now seen corresponding path program 1 times [2018-11-10 01:18:44,731 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:44,731 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:44,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:44,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:44,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:18:44,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:18:44,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:18:44,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:18:44,869 INFO L87 Difference]: Start difference. First operand 1283 states and 1530 transitions. Second operand 3 states. [2018-11-10 01:18:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:44,918 INFO L93 Difference]: Finished difference Result 2254 states and 2696 transitions. [2018-11-10 01:18:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:18:44,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-11-10 01:18:44,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:44,922 INFO L225 Difference]: With dead ends: 2254 [2018-11-10 01:18:44,922 INFO L226 Difference]: Without dead ends: 1276 [2018-11-10 01:18:44,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 225 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-11-10 01:18:44,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-11-10 01:18:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2018-11-10 01:18:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-11-10 01:18:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1516 transitions. [2018-11-10 01:18:44,938 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1516 transitions. Word has length 227 [2018-11-10 01:18:44,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:44,939 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1516 transitions. [2018-11-10 01:18:44,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:18:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1516 transitions. [2018-11-10 01:18:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 01:18:44,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:44,941 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:44,942 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:44,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -107230582, now seen corresponding path program 1 times [2018-11-10 01:18:44,942 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:44,943 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:44,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:45,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:45,380 INFO L477 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-11-10 01:18:45,383 INFO L477 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-11-10 01:18:45,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:18:45,447 INFO L477 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-11-10 01:18:45,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:45,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:45,454 INFO L477 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-11-10 01:18:45,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:18:45,521 INFO L477 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 22 treesize of output 16 [2018-11-10 01:18:45,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:45,525 INFO L477 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 16 treesize of output 8 [2018-11-10 01:18:45,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:45,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:18:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 01:18:45,606 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:18:45,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:18:45,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:18:45,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:18:45,616 INFO L87 Difference]: Start difference. First operand 1276 states and 1516 transitions. Second operand 9 states. [2018-11-10 01:18:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:47,139 INFO L93 Difference]: Finished difference Result 3169 states and 3819 transitions. [2018-11-10 01:18:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:47,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-11-10 01:18:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:47,145 INFO L225 Difference]: With dead ends: 3169 [2018-11-10 01:18:47,145 INFO L226 Difference]: Without dead ends: 1957 [2018-11-10 01:18:47,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:18:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2018-11-10 01:18:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1420. [2018-11-10 01:18:47,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-11-10 01:18:47,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1716 transitions. [2018-11-10 01:18:47,181 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1716 transitions. Word has length 231 [2018-11-10 01:18:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:47,181 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 1716 transitions. [2018-11-10 01:18:47,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:18:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1716 transitions. [2018-11-10 01:18:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 01:18:47,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:47,185 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:47,185 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:47,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1014112726, now seen corresponding path program 1 times [2018-11-10 01:18:47,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:47,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:47,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:47,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:47,655 INFO L477 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-11-10 01:18:47,656 INFO L477 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-11-10 01:18:47,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:18:47,683 INFO L477 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-11-10 01:18:47,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:47,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:47,689 INFO L477 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-11-10 01:18:47,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:18:47,723 INFO L477 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 22 treesize of output 16 [2018-11-10 01:18:47,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:47,727 INFO L477 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 16 treesize of output 8 [2018-11-10 01:18:47,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:47,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:18:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:47,792 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:47,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:47,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:18:47,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:18:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:18:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:18:47,795 INFO L87 Difference]: Start difference. First operand 1420 states and 1716 transitions. Second operand 9 states. [2018-11-10 01:18:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:48,855 INFO L93 Difference]: Finished difference Result 3450 states and 4211 transitions. [2018-11-10 01:18:48,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:48,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-11-10 01:18:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:48,861 INFO L225 Difference]: With dead ends: 3450 [2018-11-10 01:18:48,861 INFO L226 Difference]: Without dead ends: 2094 [2018-11-10 01:18:48,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:18:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-11-10 01:18:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1608. [2018-11-10 01:18:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2018-11-10 01:18:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1984 transitions. [2018-11-10 01:18:48,904 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1984 transitions. Word has length 231 [2018-11-10 01:18:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:48,905 INFO L481 AbstractCegarLoop]: Abstraction has 1608 states and 1984 transitions. [2018-11-10 01:18:48,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:18:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1984 transitions. [2018-11-10 01:18:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-10 01:18:48,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:48,909 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:48,909 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:48,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 203424325, now seen corresponding path program 1 times [2018-11-10 01:18:48,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:48,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:48,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:49,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:49,303 INFO L477 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-11-10 01:18:49,305 INFO L477 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-11-10 01:18:49,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:18:49,332 INFO L477 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-11-10 01:18:49,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:49,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:49,335 INFO L477 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-11-10 01:18:49,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:18:49,379 INFO L477 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 22 treesize of output 16 [2018-11-10 01:18:49,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:49,382 INFO L477 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 16 treesize of output 8 [2018-11-10 01:18:49,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:49,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:18:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-11-10 01:18:49,457 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:18:49,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:18:49,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 01:18:49,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:18:49,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:18:49,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:18:49,460 INFO L87 Difference]: Start difference. First operand 1608 states and 1984 transitions. Second operand 9 states. [2018-11-10 01:18:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:18:50,346 INFO L93 Difference]: Finished difference Result 3610 states and 4445 transitions. [2018-11-10 01:18:50,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 01:18:50,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 233 [2018-11-10 01:18:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:18:50,351 INFO L225 Difference]: With dead ends: 3610 [2018-11-10 01:18:50,351 INFO L226 Difference]: Without dead ends: 2066 [2018-11-10 01:18:50,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-10 01:18:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-10 01:18:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1616. [2018-11-10 01:18:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-11-10 01:18:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1992 transitions. [2018-11-10 01:18:50,379 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1992 transitions. Word has length 233 [2018-11-10 01:18:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:18:50,379 INFO L481 AbstractCegarLoop]: Abstraction has 1616 states and 1992 transitions. [2018-11-10 01:18:50,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:18:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1992 transitions. [2018-11-10 01:18:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 01:18:50,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:18:50,383 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:18:50,383 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:18:50,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:18:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1935717201, now seen corresponding path program 1 times [2018-11-10 01:18:50,384 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:18:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:18:50,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:18:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:18:50,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:18:50,759 INFO L477 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 6 treesize of output 5 [2018-11-10 01:18:50,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:18:50,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:50,799 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:50,799 INFO L477 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 13 treesize of output 4 [2018-11-10 01:18:50,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 01:18:50,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:18:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:18:50,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 01:18:50,842 INFO L477 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 24 treesize of output 19 [2018-11-10 01:18:50,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:50,847 INFO L477 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 19 treesize of output 28 [2018-11-10 01:18:50,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-11-10 01:18:50,894 INFO L477 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-11-10 01:18:50,897 INFO L477 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-11-10 01:18:50,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 01:18:50,927 INFO L477 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-11-10 01:18:50,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:50,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:50,931 INFO L477 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-11-10 01:18:50,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:50,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-11-10 01:18:51,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2018-11-10 01:18:51,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2018-11-10 01:18:51,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-11-10 01:18:51,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,197 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:18:51,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 57 [2018-11-10 01:18:51,202 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:18:51,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 25 treesize of output 37 [2018-11-10 01:18:51,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-11-10 01:18:51,238 INFO L477 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 26 treesize of output 22 [2018-11-10 01:18:51,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 22 treesize of output 14 [2018-11-10 01:18:51,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,258 INFO L477 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 30 treesize of output 24 [2018-11-10 01:18:51,261 INFO L477 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 24 treesize of output 15 [2018-11-10 01:18:51,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:18:51,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2018-11-10 01:18:51,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-10 01:18:51,339 INFO L477 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-11-10 01:18:51,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:18:51,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:4 [2018-11-10 01:18:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 161 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 01:18:51,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:18:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 165 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-10 01:18:52,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:18:52,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2018-11-10 01:18:52,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 01:18:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 01:18:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:18:52,030 INFO L87 Difference]: Start difference. First operand 1616 states and 1992 transitions. Second operand 23 states. [2018-11-10 01:18:57,647 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-10 01:19:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:04,816 INFO L93 Difference]: Finished difference Result 11259 states and 14056 transitions. [2018-11-10 01:19:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 01:19:04,817 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 241 [2018-11-10 01:19:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:04,837 INFO L225 Difference]: With dead ends: 11259 [2018-11-10 01:19:04,837 INFO L226 Difference]: Without dead ends: 9707 [2018-11-10 01:19:04,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=439, Invalid=1723, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 01:19:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2018-11-10 01:19:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 5554. [2018-11-10 01:19:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5554 states. [2018-11-10 01:19:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 7070 transitions. [2018-11-10 01:19:05,023 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 7070 transitions. Word has length 241 [2018-11-10 01:19:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:05,023 INFO L481 AbstractCegarLoop]: Abstraction has 5554 states and 7070 transitions. [2018-11-10 01:19:05,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 01:19:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 7070 transitions. [2018-11-10 01:19:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 01:19:05,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:05,031 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:05,031 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:05,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1781473081, now seen corresponding path program 1 times [2018-11-10 01:19:05,032 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:05,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:05,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-10 01:19:05,199 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:19:05,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:19:05,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:19:05,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:19:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:19:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:19:05,202 INFO L87 Difference]: Start difference. First operand 5554 states and 7070 transitions. Second operand 3 states. [2018-11-10 01:19:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:05,300 INFO L93 Difference]: Finished difference Result 11166 states and 14214 transitions. [2018-11-10 01:19:05,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:19:05,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-11-10 01:19:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:05,313 INFO L225 Difference]: With dead ends: 11166 [2018-11-10 01:19:05,313 INFO L226 Difference]: Without dead ends: 5676 [2018-11-10 01:19:05,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 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-11-10 01:19:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2018-11-10 01:19:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5610. [2018-11-10 01:19:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2018-11-10 01:19:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 7110 transitions. [2018-11-10 01:19:05,465 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 7110 transitions. Word has length 244 [2018-11-10 01:19:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:05,465 INFO L481 AbstractCegarLoop]: Abstraction has 5610 states and 7110 transitions. [2018-11-10 01:19:05,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:19:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 7110 transitions. [2018-11-10 01:19:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-10 01:19:05,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:05,473 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:05,474 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:05,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash -647482654, now seen corresponding path program 1 times [2018-11-10 01:19:05,475 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:05,475 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:05,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:05,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-10 01:19:05,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:19:05,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:19:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 01:19:05,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 01:19:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:19:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:19:05,650 INFO L87 Difference]: Start difference. First operand 5610 states and 7110 transitions. Second operand 3 states. [2018-11-10 01:19:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:05,779 INFO L93 Difference]: Finished difference Result 16555 states and 21013 transitions. [2018-11-10 01:19:05,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:19:05,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-11-10 01:19:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:05,801 INFO L225 Difference]: With dead ends: 16555 [2018-11-10 01:19:05,801 INFO L226 Difference]: Without dead ends: 11009 [2018-11-10 01:19:05,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 251 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-11-10 01:19:05,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2018-11-10 01:19:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11005. [2018-11-10 01:19:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11005 states. [2018-11-10 01:19:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11005 states to 11005 states and 13922 transitions. [2018-11-10 01:19:06,116 INFO L78 Accepts]: Start accepts. Automaton has 11005 states and 13922 transitions. Word has length 253 [2018-11-10 01:19:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:06,117 INFO L481 AbstractCegarLoop]: Abstraction has 11005 states and 13922 transitions. [2018-11-10 01:19:06,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 01:19:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 11005 states and 13922 transitions. [2018-11-10 01:19:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 01:19:06,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:06,130 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:06,130 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:06,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:06,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1077562714, now seen corresponding path program 1 times [2018-11-10 01:19:06,131 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:06,131 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:06,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:06,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:06,271 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:06,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:06,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:06,321 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:06,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:06,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 01:19:06,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:06,392 INFO L477 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-11-10 01:19:06,394 INFO L477 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 3 [2018-11-10 01:19:06,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:06,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 01:19:06,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:06,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:06,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:06,484 INFO L87 Difference]: Start difference. First operand 11005 states and 13922 transitions. Second operand 13 states. [2018-11-10 01:19:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:08,172 INFO L93 Difference]: Finished difference Result 22044 states and 27584 transitions. [2018-11-10 01:19:08,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 01:19:08,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 259 [2018-11-10 01:19:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:08,188 INFO L225 Difference]: With dead ends: 22044 [2018-11-10 01:19:08,188 INFO L226 Difference]: Without dead ends: 13424 [2018-11-10 01:19:08,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:19:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13424 states. [2018-11-10 01:19:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13424 to 11491. [2018-11-10 01:19:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11491 states. [2018-11-10 01:19:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11491 states to 11491 states and 14504 transitions. [2018-11-10 01:19:08,421 INFO L78 Accepts]: Start accepts. Automaton has 11491 states and 14504 transitions. Word has length 259 [2018-11-10 01:19:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:08,422 INFO L481 AbstractCegarLoop]: Abstraction has 11491 states and 14504 transitions. [2018-11-10 01:19:08,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11491 states and 14504 transitions. [2018-11-10 01:19:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 01:19:08,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:08,430 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:08,431 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:08,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:08,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1774487771, now seen corresponding path program 1 times [2018-11-10 01:19:08,431 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:08,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:08,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:08,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:08,875 INFO L477 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 6 treesize of output 5 [2018-11-10 01:19:08,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:08,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:08,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:19:08,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-11-10 01:19:08,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:08,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:19:08,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-11-10 01:19:08,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:08,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:08,987 INFO L477 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 13 treesize of output 4 [2018-11-10 01:19:08,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 01:19:09,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:19:09,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:19:09,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 01:19:09,118 INFO L477 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-11-10 01:19:09,123 INFO L477 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-11-10 01:19:09,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 01:19:09,162 INFO L477 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 18 treesize of output 14 [2018-11-10 01:19:09,164 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:19:09,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 01:19:09,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-11-10 01:19:09,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 01:19:09,207 INFO L477 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 12 treesize of output 11 [2018-11-10 01:19:09,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-11-10 01:19:09,252 INFO L477 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-11-10 01:19:09,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:09,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:09,256 INFO L477 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-11-10 01:19:09,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:19:09,294 INFO L477 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 22 treesize of output 16 [2018-11-10 01:19:09,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:09,296 INFO L477 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 16 treesize of output 8 [2018-11-10 01:19:09,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:19:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:09,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:09,663 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-11-10 01:19:09,704 INFO L477 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 11 treesize of output 10 [2018-11-10 01:19:09,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,722 INFO L477 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 10 treesize of output 8 [2018-11-10 01:19:09,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-10 01:19:09,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,727 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:09,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:10 [2018-11-10 01:19:12,057 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:12,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:12,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-10 01:19:12,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 01:19:12,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 01:19:12,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=442, Unknown=1, NotChecked=0, Total=506 [2018-11-10 01:19:12,060 INFO L87 Difference]: Start difference. First operand 11491 states and 14504 transitions. Second operand 23 states. [2018-11-10 01:19:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:18,745 INFO L93 Difference]: Finished difference Result 33278 states and 42071 transitions. [2018-11-10 01:19:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 01:19:18,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 259 [2018-11-10 01:19:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:18,771 INFO L225 Difference]: With dead ends: 33278 [2018-11-10 01:19:18,771 INFO L226 Difference]: Without dead ends: 21856 [2018-11-10 01:19:18,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=199, Invalid=990, Unknown=1, NotChecked=0, Total=1190 [2018-11-10 01:19:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21856 states. [2018-11-10 01:19:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21856 to 13753. [2018-11-10 01:19:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13753 states. [2018-11-10 01:19:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 17618 transitions. [2018-11-10 01:19:19,184 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 17618 transitions. Word has length 259 [2018-11-10 01:19:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:19,185 INFO L481 AbstractCegarLoop]: Abstraction has 13753 states and 17618 transitions. [2018-11-10 01:19:19,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 01:19:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 17618 transitions. [2018-11-10 01:19:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 01:19:19,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:19,202 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:19,202 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:19,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -372553600, now seen corresponding path program 1 times [2018-11-10 01:19:19,203 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:19,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:19,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:19,671 INFO L477 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 6 treesize of output 5 [2018-11-10 01:19:19,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:19:19,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-11-10 01:19:19,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:19:19,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-11-10 01:19:19,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:19,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:19,719 INFO L477 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 13 treesize of output 4 [2018-11-10 01:19:19,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 01:19:19,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:19:19,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:19:19,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 01:19:19,788 INFO L477 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-11-10 01:19:19,789 INFO L477 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-11-10 01:19:19,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 01:19:19,819 INFO L477 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 18 treesize of output 14 [2018-11-10 01:19:19,821 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:19:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 01:19:19,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-11-10 01:19:19,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 01:19:19,866 INFO L477 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 12 treesize of output 11 [2018-11-10 01:19:19,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-11-10 01:19:19,913 INFO L477 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-11-10 01:19:19,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:19,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:19,916 INFO L477 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-11-10 01:19:19,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:19:19,955 INFO L477 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 22 treesize of output 16 [2018-11-10 01:19:19,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:19,957 INFO L477 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 16 treesize of output 8 [2018-11-10 01:19:19,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:19,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:19:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:20,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:20,430 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-10 01:19:20,472 INFO L477 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 11 treesize of output 10 [2018-11-10 01:19:20,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:20,489 INFO L477 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 10 treesize of output 8 [2018-11-10 01:19:20,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-10 01:19:20,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:20,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:20,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:20,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:20,512 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-11-10 01:19:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:22,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:22,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-10 01:19:22,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 01:19:22,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 01:19:22,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=442, Unknown=1, NotChecked=0, Total=506 [2018-11-10 01:19:22,773 INFO L87 Difference]: Start difference. First operand 13753 states and 17618 transitions. Second operand 23 states. [2018-11-10 01:19:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:30,041 INFO L93 Difference]: Finished difference Result 37098 states and 47358 transitions. [2018-11-10 01:19:30,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 01:19:30,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 261 [2018-11-10 01:19:30,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:30,063 INFO L225 Difference]: With dead ends: 37098 [2018-11-10 01:19:30,063 INFO L226 Difference]: Without dead ends: 23414 [2018-11-10 01:19:30,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 497 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=199, Invalid=990, Unknown=1, NotChecked=0, Total=1190 [2018-11-10 01:19:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23414 states. [2018-11-10 01:19:30,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23414 to 14103. [2018-11-10 01:19:30,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14103 states. [2018-11-10 01:19:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 18140 transitions. [2018-11-10 01:19:30,485 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 18140 transitions. Word has length 261 [2018-11-10 01:19:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:30,485 INFO L481 AbstractCegarLoop]: Abstraction has 14103 states and 18140 transitions. [2018-11-10 01:19:30,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 01:19:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 18140 transitions. [2018-11-10 01:19:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 01:19:30,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:30,493 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:30,493 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:30,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash -602062485, now seen corresponding path program 1 times [2018-11-10 01:19:30,494 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:30,494 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:30,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:30,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:30,632 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:30,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:30,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:30,679 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:30,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:30,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 01:19:30,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:30,742 INFO L477 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-11-10 01:19:30,745 INFO L477 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 3 [2018-11-10 01:19:30,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:30,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 01:19:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:30,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:30,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:30,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:30,829 INFO L87 Difference]: Start difference. First operand 14103 states and 18140 transitions. Second operand 13 states. [2018-11-10 01:19:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:32,654 INFO L93 Difference]: Finished difference Result 28278 states and 36030 transitions. [2018-11-10 01:19:32,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:19:32,655 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2018-11-10 01:19:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:32,665 INFO L225 Difference]: With dead ends: 28278 [2018-11-10 01:19:32,665 INFO L226 Difference]: Without dead ends: 17010 [2018-11-10 01:19:32,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:19:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2018-11-10 01:19:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 14559. [2018-11-10 01:19:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2018-11-10 01:19:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 18704 transitions. [2018-11-10 01:19:32,975 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 18704 transitions. Word has length 261 [2018-11-10 01:19:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:32,975 INFO L481 AbstractCegarLoop]: Abstraction has 14559 states and 18704 transitions. [2018-11-10 01:19:32,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 18704 transitions. [2018-11-10 01:19:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-10 01:19:32,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:32,982 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:32,982 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:32,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 305725346, now seen corresponding path program 2 times [2018-11-10 01:19:32,983 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:32,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:32,994 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-10 01:19:33,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:19:33,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:19:33,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:33,253 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:33,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:33,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:33,298 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:33,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:33,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 198 proven. 17 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 01:19:33,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:33,371 INFO L477 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-11-10 01:19:33,372 INFO L477 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 3 [2018-11-10 01:19:33,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:33,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 198 proven. 17 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 01:19:33,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:33,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:33,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:33,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:33,460 INFO L87 Difference]: Start difference. First operand 14559 states and 18704 transitions. Second operand 13 states. [2018-11-10 01:19:35,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:35,340 INFO L93 Difference]: Finished difference Result 33746 states and 42906 transitions. [2018-11-10 01:19:35,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 01:19:35,341 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 263 [2018-11-10 01:19:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:35,353 INFO L225 Difference]: With dead ends: 33746 [2018-11-10 01:19:35,353 INFO L226 Difference]: Without dead ends: 19256 [2018-11-10 01:19:35,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 517 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:19:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19256 states. [2018-11-10 01:19:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19256 to 16253. [2018-11-10 01:19:35,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16253 states. [2018-11-10 01:19:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16253 states to 16253 states and 20844 transitions. [2018-11-10 01:19:35,743 INFO L78 Accepts]: Start accepts. Automaton has 16253 states and 20844 transitions. Word has length 263 [2018-11-10 01:19:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:35,744 INFO L481 AbstractCegarLoop]: Abstraction has 16253 states and 20844 transitions. [2018-11-10 01:19:35,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 16253 states and 20844 transitions. [2018-11-10 01:19:35,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 01:19:35,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:35,757 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:35,757 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:35,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:35,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2079855805, now seen corresponding path program 1 times [2018-11-10 01:19:35,758 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:35,758 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:35,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:19:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:35,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:35,862 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:35,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:35,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:35,909 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:35,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:35,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 206 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 01:19:35,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:35,973 INFO L477 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-11-10 01:19:35,975 INFO L477 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 3 [2018-11-10 01:19:35,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:35,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 206 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 01:19:36,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:36,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:36,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:36,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:36,065 INFO L87 Difference]: Start difference. First operand 16253 states and 20844 transitions. Second operand 13 states. [2018-11-10 01:19:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:38,048 INFO L93 Difference]: Finished difference Result 38068 states and 48236 transitions. [2018-11-10 01:19:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:19:38,049 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2018-11-10 01:19:38,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:38,062 INFO L225 Difference]: With dead ends: 38068 [2018-11-10 01:19:38,063 INFO L226 Difference]: Without dead ends: 21884 [2018-11-10 01:19:38,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:19:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21884 states. [2018-11-10 01:19:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21884 to 16525. [2018-11-10 01:19:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2018-11-10 01:19:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 21160 transitions. [2018-11-10 01:19:38,466 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 21160 transitions. Word has length 265 [2018-11-10 01:19:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:38,467 INFO L481 AbstractCegarLoop]: Abstraction has 16525 states and 21160 transitions. [2018-11-10 01:19:38,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 21160 transitions. [2018-11-10 01:19:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 01:19:38,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:38,474 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:38,474 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:38,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash -307796730, now seen corresponding path program 1 times [2018-11-10 01:19:38,475 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:38,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:38,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:38,591 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:38,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:38,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:38,638 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:38,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:38,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 211 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 01:19:38,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:38,751 INFO L477 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-11-10 01:19:38,752 INFO L477 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 3 [2018-11-10 01:19:38,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:38,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 211 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 01:19:38,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:38,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:38,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:38,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:38,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:38,843 INFO L87 Difference]: Start difference. First operand 16525 states and 21160 transitions. Second operand 13 states. [2018-11-10 01:19:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:41,370 INFO L93 Difference]: Finished difference Result 41830 states and 52796 transitions. [2018-11-10 01:19:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 01:19:41,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2018-11-10 01:19:41,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:41,386 INFO L225 Difference]: With dead ends: 41830 [2018-11-10 01:19:41,386 INFO L226 Difference]: Without dead ends: 25374 [2018-11-10 01:19:41,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:19:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25374 states. [2018-11-10 01:19:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25374 to 19397. [2018-11-10 01:19:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19397 states. [2018-11-10 01:19:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19397 states to 19397 states and 24810 transitions. [2018-11-10 01:19:41,954 INFO L78 Accepts]: Start accepts. Automaton has 19397 states and 24810 transitions. Word has length 267 [2018-11-10 01:19:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:41,954 INFO L481 AbstractCegarLoop]: Abstraction has 19397 states and 24810 transitions. [2018-11-10 01:19:41,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 19397 states and 24810 transitions. [2018-11-10 01:19:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 01:19:41,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:41,963 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:41,963 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:41,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:41,963 INFO L82 PathProgramCache]: Analyzing trace with hash 839425611, now seen corresponding path program 1 times [2018-11-10 01:19:41,964 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:41,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:41,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:42,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:42,066 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:42,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:42,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:42,116 INFO L477 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 19 treesize of output 15 [2018-11-10 01:19:42,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:19:42,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 01:19:42,158 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 01:19:42,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:42,181 INFO L477 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-11-10 01:19:42,183 INFO L477 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 3 [2018-11-10 01:19:42,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:42,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-11-10 01:19:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 01:19:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-10 01:19:42,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:19:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:19:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 01:19:42,275 INFO L87 Difference]: Start difference. First operand 19397 states and 24810 transitions. Second operand 13 states. [2018-11-10 01:19:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:19:44,786 INFO L93 Difference]: Finished difference Result 48836 states and 61649 transitions. [2018-11-10 01:19:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:19:44,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 269 [2018-11-10 01:19:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:19:44,803 INFO L225 Difference]: With dead ends: 48836 [2018-11-10 01:19:44,803 INFO L226 Difference]: Without dead ends: 29508 [2018-11-10 01:19:44,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:19:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29508 states. [2018-11-10 01:19:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29508 to 20043. [2018-11-10 01:19:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20043 states. [2018-11-10 01:19:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20043 states to 20043 states and 25630 transitions. [2018-11-10 01:19:45,353 INFO L78 Accepts]: Start accepts. Automaton has 20043 states and 25630 transitions. Word has length 269 [2018-11-10 01:19:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:19:45,353 INFO L481 AbstractCegarLoop]: Abstraction has 20043 states and 25630 transitions. [2018-11-10 01:19:45,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:19:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 20043 states and 25630 transitions. [2018-11-10 01:19:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-10 01:19:45,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:19:45,363 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:19:45,363 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:19:45,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:19:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1902782442, now seen corresponding path program 1 times [2018-11-10 01:19:45,364 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:19:45,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:19:45,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:19:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:19:45,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:19:45,758 INFO L477 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 6 treesize of output 5 [2018-11-10 01:19:45,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:19:45,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-11-10 01:19:45,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:19:45,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-11-10 01:19:45,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:45,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:45,784 INFO L477 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 13 treesize of output 4 [2018-11-10 01:19:45,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 01:19:45,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:19:45,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:19:45,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 01:19:45,855 INFO L477 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-11-10 01:19:45,858 INFO L477 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-11-10 01:19:45,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 01:19:45,901 INFO L477 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 18 treesize of output 14 [2018-11-10 01:19:45,904 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:19:45,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 01:19:45,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-11-10 01:19:45,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 01:19:45,951 INFO L477 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 12 treesize of output 11 [2018-11-10 01:19:45,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:45,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-11-10 01:19:45,995 INFO L477 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-11-10 01:19:45,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:45,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:45,998 INFO L477 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-11-10 01:19:45,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:19:46,034 INFO L477 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-11-10 01:19:46,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:46,036 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:19:46,036 INFO L477 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-11-10 01:19:46,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:7 [2018-11-10 01:19:46,071 INFO L477 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-11-10 01:19:46,073 INFO L477 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-11-10 01:19:46,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:19:46,082 INFO L477 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 15 treesize of output 11 [2018-11-10 01:19:46,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 01:19:46,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 01:19:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:46,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:19:46,540 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-11-10 01:19:46,582 INFO L477 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 11 treesize of output 10 [2018-11-10 01:19:46,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,599 INFO L477 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 10 treesize of output 8 [2018-11-10 01:19:46,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-10 01:19:46,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:19:46,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:10 [2018-11-10 01:19:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:19:48,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:19:49,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-10 01:19:49,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 01:19:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 01:19:49,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=628, Unknown=1, NotChecked=0, Total=702 [2018-11-10 01:19:49,000 INFO L87 Difference]: Start difference. First operand 20043 states and 25630 transitions. Second operand 27 states. [2018-11-10 01:20:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:06,426 INFO L93 Difference]: Finished difference Result 114824 states and 145178 transitions. [2018-11-10 01:20:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 01:20:06,428 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 269 [2018-11-10 01:20:06,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:06,489 INFO L225 Difference]: With dead ends: 114824 [2018-11-10 01:20:06,490 INFO L226 Difference]: Without dead ends: 94850 [2018-11-10 01:20:06,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 509 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=790, Invalid=4039, Unknown=1, NotChecked=0, Total=4830 [2018-11-10 01:20:06,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94850 states. [2018-11-10 01:20:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94850 to 20726. [2018-11-10 01:20:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20726 states. [2018-11-10 01:20:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20726 states to 20726 states and 26572 transitions. [2018-11-10 01:20:07,471 INFO L78 Accepts]: Start accepts. Automaton has 20726 states and 26572 transitions. Word has length 269 [2018-11-10 01:20:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 20726 states and 26572 transitions. [2018-11-10 01:20:07,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 01:20:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 20726 states and 26572 transitions. [2018-11-10 01:20:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-11-10 01:20:07,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:07,480 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:07,481 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:07,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1273963515, now seen corresponding path program 1 times [2018-11-10 01:20:07,481 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:07,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:07,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:07,880 INFO L477 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 6 treesize of output 5 [2018-11-10 01:20:07,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:20:07,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-11-10 01:20:07,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:07,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-11-10 01:20:07,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:07,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:07,917 INFO L477 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 13 treesize of output 4 [2018-11-10 01:20:07,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-10 01:20:07,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:20:07,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:20:07,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-11-10 01:20:07,985 INFO L477 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-11-10 01:20:07,988 INFO L477 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-11-10 01:20:07,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:07,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 01:20:08,023 INFO L477 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 18 treesize of output 14 [2018-11-10 01:20:08,024 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:20:08,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-11-10 01:20:08,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-11-10 01:20:08,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-10 01:20:08,075 INFO L477 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 12 treesize of output 11 [2018-11-10 01:20:08,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-11-10 01:20:08,119 INFO L477 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-11-10 01:20:08,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:08,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:08,123 INFO L477 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-11-10 01:20:08,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:20:08,158 INFO L477 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-11-10 01:20:08,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:08,160 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:08,161 INFO L477 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-11-10 01:20:08,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:7 [2018-11-10 01:20:08,196 INFO L477 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-11-10 01:20:08,197 INFO L477 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-11-10 01:20:08,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:20:08,206 INFO L477 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 15 treesize of output 11 [2018-11-10 01:20:08,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 01:20:08,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 01:20:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:20:08,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:20:08,629 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-11-10 01:20:08,671 INFO L477 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 11 treesize of output 10 [2018-11-10 01:20:08,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,689 INFO L477 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 10 treesize of output 8 [2018-11-10 01:20:08,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 8 treesize of output 1 [2018-11-10 01:20:08,692 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:08,711 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-11-10 01:20:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-11-10 01:20:11,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:20:11,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-11-10 01:20:11,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 01:20:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 01:20:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=628, Unknown=1, NotChecked=0, Total=702 [2018-11-10 01:20:11,025 INFO L87 Difference]: Start difference. First operand 20726 states and 26572 transitions. Second operand 27 states. [2018-11-10 01:20:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:28,471 INFO L93 Difference]: Finished difference Result 116401 states and 147235 transitions. [2018-11-10 01:20:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 01:20:28,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 271 [2018-11-10 01:20:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:28,539 INFO L225 Difference]: With dead ends: 116401 [2018-11-10 01:20:28,539 INFO L226 Difference]: Without dead ends: 95744 [2018-11-10 01:20:28,554 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 513 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=790, Invalid=4039, Unknown=1, NotChecked=0, Total=4830 [2018-11-10 01:20:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95744 states. [2018-11-10 01:20:29,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95744 to 20211. [2018-11-10 01:20:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20211 states. [2018-11-10 01:20:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20211 states to 20211 states and 25832 transitions. [2018-11-10 01:20:29,461 INFO L78 Accepts]: Start accepts. Automaton has 20211 states and 25832 transitions. Word has length 271 [2018-11-10 01:20:29,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:29,461 INFO L481 AbstractCegarLoop]: Abstraction has 20211 states and 25832 transitions. [2018-11-10 01:20:29,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 01:20:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20211 states and 25832 transitions. [2018-11-10 01:20:29,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-11-10 01:20:29,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:29,470 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:29,470 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:29,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:29,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1338838841, now seen corresponding path program 1 times [2018-11-10 01:20:29,471 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:29,471 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:29,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:29,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:29,897 INFO L477 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 6 treesize of output 5 [2018-11-10 01:20:29,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:20:29,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:29,915 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:29,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-11-10 01:20:29,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-11-10 01:20:29,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:20:29,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:20:29,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-11-10 01:20:29,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-10 01:20:29,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:29,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-11-10 01:20:30,028 INFO L477 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 37 treesize of output 30 [2018-11-10 01:20:30,031 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,037 INFO L477 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 30 treesize of output 41 [2018-11-10 01:20:30,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-10 01:20:30,129 INFO L477 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-11-10 01:20:30,131 INFO L477 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-11-10 01:20:30,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-10 01:20:30,174 INFO L477 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 25 treesize of output 20 [2018-11-10 01:20:30,177 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:30,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:50 [2018-11-10 01:20:30,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,239 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 01:20:30,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2018-11-10 01:20:30,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 01:20:30,330 INFO L477 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 8 treesize of output 7 [2018-11-10 01:20:30,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:30,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-11-10 01:20:30,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-10 01:20:30,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:30,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:30,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:30,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-11-10 01:20:30,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 01:20:30,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:20:30,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 01:20:30,524 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:30,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-11-10 01:20:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 01:20:30,628 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:20:30,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:20:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 01:20:30,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:20:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:20:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:20:30,631 INFO L87 Difference]: Start difference. First operand 20211 states and 25832 transitions. Second operand 15 states. [2018-11-10 01:20:31,828 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-11-10 01:20:32,349 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 01:20:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:35,268 INFO L93 Difference]: Finished difference Result 36916 states and 47150 transitions. [2018-11-10 01:20:35,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:20:35,269 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 272 [2018-11-10 01:20:35,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:35,281 INFO L225 Difference]: With dead ends: 36916 [2018-11-10 01:20:35,281 INFO L226 Difference]: Without dead ends: 20608 [2018-11-10 01:20:35,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:20:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20608 states. [2018-11-10 01:20:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20608 to 20243. [2018-11-10 01:20:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20243 states. [2018-11-10 01:20:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 25874 transitions. [2018-11-10 01:20:35,982 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 25874 transitions. Word has length 272 [2018-11-10 01:20:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:35,983 INFO L481 AbstractCegarLoop]: Abstraction has 20243 states and 25874 transitions. [2018-11-10 01:20:35,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:20:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 25874 transitions. [2018-11-10 01:20:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-11-10 01:20:35,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:35,992 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:35,992 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:35,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:35,993 INFO L82 PathProgramCache]: Analyzing trace with hash 240674964, now seen corresponding path program 1 times [2018-11-10 01:20:35,993 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:35,993 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:36,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:36,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:36,456 INFO L477 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 6 treesize of output 5 [2018-11-10 01:20:36,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:20:36,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,473 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-11-10 01:20:36,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-11-10 01:20:36,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:20:36,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:20:36,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-11-10 01:20:36,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-10 01:20:36,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-11-10 01:20:36,559 INFO L477 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 37 treesize of output 30 [2018-11-10 01:20:36,562 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,564 INFO L477 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 30 treesize of output 41 [2018-11-10 01:20:36,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-10 01:20:36,648 INFO L477 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-11-10 01:20:36,650 INFO L477 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-11-10 01:20:36,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-10 01:20:36,695 INFO L477 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 25 treesize of output 20 [2018-11-10 01:20:36,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:36,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:50 [2018-11-10 01:20:36,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,751 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-10 01:20:36,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2018-11-10 01:20:36,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 01:20:36,850 INFO L477 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 8 treesize of output 7 [2018-11-10 01:20:36,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:36,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-11-10 01:20:36,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-10 01:20:36,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:36,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:36,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:36,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:37,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:37,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-11-10 01:20:37,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 01:20:37,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:20:37,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:37,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 01:20:37,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:37,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:37,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:37,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-11-10 01:20:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 01:20:37,184 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:20:37,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:20:37,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 01:20:37,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:20:37,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:20:37,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:20:37,187 INFO L87 Difference]: Start difference. First operand 20243 states and 25874 transitions. Second operand 15 states. [2018-11-10 01:20:38,238 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-11-10 01:20:38,804 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 01:20:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:41,607 INFO L93 Difference]: Finished difference Result 36906 states and 47138 transitions. [2018-11-10 01:20:41,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:20:41,608 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 274 [2018-11-10 01:20:41,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:41,622 INFO L225 Difference]: With dead ends: 36906 [2018-11-10 01:20:41,622 INFO L226 Difference]: Without dead ends: 20598 [2018-11-10 01:20:41,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:20:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-11-10 01:20:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-11-10 01:20:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-11-10 01:20:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25878 transitions. [2018-11-10 01:20:42,358 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25878 transitions. Word has length 274 [2018-11-10 01:20:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:42,358 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25878 transitions. [2018-11-10 01:20:42,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:20:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25878 transitions. [2018-11-10 01:20:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-10 01:20:42,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:42,368 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:42,368 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:42,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:42,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1904549196, now seen corresponding path program 1 times [2018-11-10 01:20:42,369 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:42,369 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:42,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:42,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:42,853 INFO L477 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 6 treesize of output 5 [2018-11-10 01:20:42,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:20:42,878 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:42,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:42,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-11-10 01:20:42,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-11-10 01:20:42,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:20:42,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:20:42,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-11-10 01:20:42,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-10 01:20:42,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-11-10 01:20:42,965 INFO L477 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 37 treesize of output 30 [2018-11-10 01:20:42,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:42,970 INFO L477 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 30 treesize of output 41 [2018-11-10 01:20:42,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:42,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-10 01:20:43,069 INFO L477 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-11-10 01:20:43,071 INFO L477 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-11-10 01:20:43,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-10 01:20:43,116 INFO L477 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 25 treesize of output 20 [2018-11-10 01:20:43,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:43,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:48 [2018-11-10 01:20:43,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,175 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 01:20:43,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:43 [2018-11-10 01:20:43,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 01:20:43,275 INFO L477 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 8 treesize of output 7 [2018-11-10 01:20:43,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:43,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-11-10 01:20:43,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-10 01:20:43,376 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:43,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:43,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:43,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-11-10 01:20:43,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 01:20:43,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 01:20:43,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:20:43,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:43,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-11-10 01:20:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-10 01:20:43,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:20:43,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:20:43,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 01:20:43,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:20:43,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:20:43,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:20:43,588 INFO L87 Difference]: Start difference. First operand 20247 states and 25878 transitions. Second operand 15 states. [2018-11-10 01:20:45,087 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-11-10 01:20:45,582 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-10 01:20:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:49,254 INFO L93 Difference]: Finished difference Result 40740 states and 52044 transitions. [2018-11-10 01:20:49,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:20:49,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 300 [2018-11-10 01:20:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:49,266 INFO L225 Difference]: With dead ends: 40740 [2018-11-10 01:20:49,266 INFO L226 Difference]: Without dead ends: 20598 [2018-11-10 01:20:49,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:20:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-11-10 01:20:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-11-10 01:20:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-11-10 01:20:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25876 transitions. [2018-11-10 01:20:50,002 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25876 transitions. Word has length 300 [2018-11-10 01:20:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:50,002 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25876 transitions. [2018-11-10 01:20:50,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:20:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25876 transitions. [2018-11-10 01:20:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-11-10 01:20:50,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:50,012 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:50,012 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:50,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -975652721, now seen corresponding path program 1 times [2018-11-10 01:20:50,012 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:50,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:50,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:50,482 INFO L477 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 6 treesize of output 5 [2018-11-10 01:20:50,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 01:20:50,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 23 [2018-11-10 01:20:50,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-11-10 01:20:50,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-11-10 01:20:50,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 01:20:50,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-11-10 01:20:50,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2018-11-10 01:20:50,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-11-10 01:20:50,595 INFO L477 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 37 treesize of output 30 [2018-11-10 01:20:50,598 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,600 INFO L477 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 30 treesize of output 41 [2018-11-10 01:20:50,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-10 01:20:50,725 INFO L477 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-11-10 01:20:50,727 INFO L477 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-11-10 01:20:50,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-10 01:20:50,770 INFO L477 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 25 treesize of output 20 [2018-11-10 01:20:50,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:50,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:48 [2018-11-10 01:20:50,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:50,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-10 01:20:50,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:43 [2018-11-10 01:20:50,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-10 01:20:50,925 INFO L477 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 8 treesize of output 7 [2018-11-10 01:20:50,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:50,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:50,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-11-10 01:20:51,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-11-10 01:20:51,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:51,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 20 treesize of output 29 [2018-11-10 01:20:51,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 01:20:51,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-11-10 01:20:51,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 01:20:51,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 01:20:51,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 01:20:51,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:51,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-11-10 01:20:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-10 01:20:51,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 01:20:51,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:20:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-10 01:20:51,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:20:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:20:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:20:51,251 INFO L87 Difference]: Start difference. First operand 20247 states and 25876 transitions. Second operand 15 states. [2018-11-10 01:20:52,332 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 01:20:52,498 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-11-10 01:20:52,842 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-10 01:20:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:20:55,775 INFO L93 Difference]: Finished difference Result 40740 states and 52042 transitions. [2018-11-10 01:20:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:20:55,776 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 302 [2018-11-10 01:20:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:20:55,790 INFO L225 Difference]: With dead ends: 40740 [2018-11-10 01:20:55,790 INFO L226 Difference]: Without dead ends: 20598 [2018-11-10 01:20:55,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 286 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-11-10 01:20:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-11-10 01:20:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-11-10 01:20:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-11-10 01:20:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25874 transitions. [2018-11-10 01:20:56,533 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25874 transitions. Word has length 302 [2018-11-10 01:20:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:20:56,534 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25874 transitions. [2018-11-10 01:20:56,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:20:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25874 transitions. [2018-11-10 01:20:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 01:20:56,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:20:56,543 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:20:56,543 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:20:56,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:20:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1687043427, now seen corresponding path program 1 times [2018-11-10 01:20:56,544 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:20:56,544 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:20:56,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:20:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:20:56,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:20:56,879 INFO L477 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 24 treesize of output 19 [2018-11-10 01:20:56,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,884 INFO L477 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 19 treesize of output 28 [2018-11-10 01:20:56,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 01:20:56,920 INFO L477 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 33 treesize of output 26 [2018-11-10 01:20:56,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 63 [2018-11-10 01:20:56,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:56,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-11-10 01:20:56,993 INFO L477 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 42 treesize of output 33 [2018-11-10 01:20:56,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:56,998 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,015 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 102 [2018-11-10 01:20:57,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-10 01:20:57,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-10 01:20:57,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,094 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,102 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2018-11-10 01:20:57,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:41 [2018-11-10 01:20:57,164 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 01:20:57,165 INFO L477 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 51 treesize of output 40 [2018-11-10 01:20:57,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 102 [2018-11-10 01:20:57,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:41 [2018-11-10 01:20:57,211 INFO L477 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 37 treesize of output 27 [2018-11-10 01:20:57,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:20:57,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 4 [2018-11-10 01:20:57,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:20:57,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:4 [2018-11-10 01:20:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 297 proven. 21 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-11-10 01:20:57,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:20:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 297 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-11-10 01:20:57,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:20:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2018-11-10 01:20:57,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 01:20:57,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 01:20:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:20:57,528 INFO L87 Difference]: Start difference. First operand 20247 states and 25874 transitions. Second operand 15 states. [2018-11-10 01:21:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:01,994 INFO L93 Difference]: Finished difference Result 63365 states and 80530 transitions. [2018-11-10 01:21:01,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 01:21:01,994 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2018-11-10 01:21:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:21:02,025 INFO L225 Difference]: With dead ends: 63365 [2018-11-10 01:21:02,025 INFO L226 Difference]: Without dead ends: 43223 [2018-11-10 01:21:02,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 592 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2018-11-10 01:21:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43223 states. [2018-11-10 01:21:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43223 to 32965. [2018-11-10 01:21:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32965 states. [2018-11-10 01:21:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32965 states to 32965 states and 42506 transitions. [2018-11-10 01:21:03,350 INFO L78 Accepts]: Start accepts. Automaton has 32965 states and 42506 transitions. Word has length 303 [2018-11-10 01:21:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:21:03,350 INFO L481 AbstractCegarLoop]: Abstraction has 32965 states and 42506 transitions. [2018-11-10 01:21:03,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 01:21:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 32965 states and 42506 transitions. [2018-11-10 01:21:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 01:21:03,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:21:03,367 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:21:03,367 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:21:03,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 292220355, now seen corresponding path program 1 times [2018-11-10 01:21:03,368 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:21:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:21:03,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:21:03,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:21:03,798 INFO L477 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-11-10 01:21:03,802 INFO L477 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-11-10 01:21:03,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 01:21:03,822 INFO L477 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-11-10 01:21:03,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:21:03,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:21:03,826 INFO L477 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-11-10 01:21:03,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 01:21:03,853 INFO L477 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 22 treesize of output 16 [2018-11-10 01:21:03,855 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 01:21:03,855 INFO L477 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 16 treesize of output 8 [2018-11-10 01:21:03,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:21:03,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-10 01:21:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 222 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 01:21:03,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:21:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-11-10 01:21:03,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:21:03,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-10 01:21:03,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 01:21:03,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 01:21:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-10 01:21:03,966 INFO L87 Difference]: Start difference. First operand 32965 states and 42506 transitions. Second operand 11 states. [2018-11-10 01:21:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:21:06,709 INFO L93 Difference]: Finished difference Result 73752 states and 94425 transitions. [2018-11-10 01:21:06,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 01:21:06,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 303 [2018-11-10 01:21:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:21:06,740 INFO L225 Difference]: With dead ends: 73752 [2018-11-10 01:21:06,740 INFO L226 Difference]: Without dead ends: 46974 [2018-11-10 01:21:06,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 598 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:21:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46974 states. [2018-11-10 01:21:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46974 to 34773. [2018-11-10 01:21:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34773 states. [2018-11-10 01:21:08,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34773 states to 34773 states and 44612 transitions. [2018-11-10 01:21:08,042 INFO L78 Accepts]: Start accepts. Automaton has 34773 states and 44612 transitions. Word has length 303 [2018-11-10 01:21:08,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:21:08,043 INFO L481 AbstractCegarLoop]: Abstraction has 34773 states and 44612 transitions. [2018-11-10 01:21:08,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 01:21:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34773 states and 44612 transitions. [2018-11-10 01:21:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-11-10 01:21:08,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:21:08,061 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 01:21:08,062 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 01:21:08,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:21:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash 459427510, now seen corresponding path program 1 times [2018-11-10 01:21:08,062 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 01:21:08,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 01:21:08,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:21:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:21:09,459 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 01:21:09,507 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,508 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,508 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,508 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:21:09 BoogieIcfgContainer [2018-11-10 01:21:09,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:21:09,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:21:09,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:21:09,568 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:21:09,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:18:43" (3/4) ... [2018-11-10 01:21:09,570 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 01:21:09,586 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,586 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,587 WARN L1239 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 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-11-10 01:21:09,649 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bec562d5-5a65-4815-86b4-27c17efad7e8/bin-2019/uautomizer/witness.graphml [2018-11-10 01:21:09,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:21:09,650 INFO L168 Benchmark]: Toolchain (without parser) took 147656.45 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 944.4 MB in the beginning and 714.4 MB in the end (delta: 230.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,650 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:21:09,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.50 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 783.3 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,651 INFO L168 Benchmark]: Boogie Preprocessor took 138.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 783.3 MB in the beginning and 1.1 GB in the end (delta: -348.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,651 INFO L168 Benchmark]: RCFGBuilder took 923.70 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,651 INFO L168 Benchmark]: TraceAbstraction took 145844.76 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 753.5 MB in the end (delta: 275.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,651 INFO L168 Benchmark]: Witness Printer took 81.91 ms. Allocated memory is still 3.2 GB. Free memory was 753.5 MB in the beginning and 714.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:21:09,652 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 664.50 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 783.3 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 783.3 MB in the beginning and 1.1 GB in the end (delta: -348.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 923.70 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: 103.4 MB). Peak memory consumption was 103.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 145844.76 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 1.0 GB in the beginning and 753.5 MB in the end (delta: 275.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 81.91 ms. Allocated memory is still 3.2 GB. Free memory was 753.5 MB in the beginning and 714.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: BitvecLiteral 0bv32 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: - CounterExampleResult [Line: 1645]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1039] static int init = 1; VAL [\old(init)=0, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={0:0}] [L1040] FCALL static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=0, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={-939142847:0}] [L1062] SSL *s ; VAL [init=1, SSLv3_client_data={-939142847:0}] [L1066] EXPR, FCALL malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1066] s = malloc (sizeof (SSL)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1067] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1067] FCALL s->s3 = malloc(sizeof(struct ssl3_state_st)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1068] EXPR, FCALL malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(SSL_CTX))={235935397:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1068] FCALL s->ctx = malloc(sizeof(SSL_CTX)) VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(SSL_CTX))={235935397:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1069] FCALL s->state = 12292 VAL [init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(SSL_CTX))={235935397:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1070] FCALL s->version = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=768, init=1, malloc (sizeof (SSL))={-1846547686:0}, malloc(sizeof(SSL_CTX))={235935397:0}, malloc(sizeof(struct ssl3_state_st))={-2012874240:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1071] CALL ssl3_connect(s) VAL [init=1, s={-1846547686:0}, SSLv3_client_data={-939142847:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 VAL [blastFlag=0, buf={0:0}, init=1, s={-1846547686:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}, tmp___1=0, tmp___2=0] [L1101] FCALL s->state = 12292 VAL [blastFlag=0, buf={0:0}, init=1, s={-1846547686:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}, tmp___1=0, tmp___2=0] [L1102] FCALL s->hit = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, blastFlag=0, buf={0:0}, init=1, s={-1846547686:0}, s={-1846547686:0}, SSLv3_client_data={-939142847:0}, tmp___1=0, tmp___2=0] [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] EXPR, FCALL malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___1=0, tmp___2=0] [L1108] tmp___0 = (int*)malloc(sizeof(int)) VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1109] FCALL *tmp___0 = 0 VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1110] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR, FCALL s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1111] cb = s->info_callback [L1119] EXPR, FCALL s->in_handshake VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->in_handshake=0, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1119] FCALL s->in_handshake += 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->in_handshake=0, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1120] COND FALSE !(tmp___1 & 12288) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=12292, skip=0, SSLv3_client_data={-939142847:0}, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=12292, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] FCALL s->new_session = 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1237] FCALL s->state = 4096 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL s->ctx VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1238] EXPR, FCALL (s->ctx)->stats.sess_connect_renegotiate VAL [={1:0}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1238] FCALL (s->ctx)->stats.sess_connect_renegotiate += 1 VAL [={1:0}, (s->ctx)->stats.sess_connect_renegotiate=0, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1243] FCALL s->server = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1249] EXPR, FCALL s->version VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->version=768, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] FCALL s->type = 4096 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1256] EXPR, FCALL s->init_buf VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->init_buf={1:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1282] FCALL s->state = 4368 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL s->ctx VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] EXPR, FCALL (s->ctx)->stats.sess_connect VAL [={1:0}, (s->ctx)->stats.sess_connect=0, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1283] FCALL (s->ctx)->stats.sess_connect += 1 VAL [={1:0}, (s->ctx)->stats.sess_connect=0, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->ctx={235935397:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1284] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=12292, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, s->state=4368, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] FCALL s->shutdown = 0 VAL [={1:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=4294967295, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1300] FCALL s->state = 4384 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1301] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->bbio VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->bbio={0:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] EXPR, FCALL s->wbio VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->bbio={0:0}, s->wbio={1:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4368, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={1:0}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4384, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] FCALL s->hit VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->hit=0, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] FCALL s->state = 4400 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4384, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4400, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL (s->s3)->tmp.new_cipher VAL [={1:0}, (s->s3)->tmp.new_cipher={-1846547686:52}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] EXPR, FCALL ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={-1846547686:52}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] FCALL s->state = 4416 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1346] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4400, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={1:0}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4416, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1361] FCALL s->state = 4432 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1362] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4416, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4432, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1384] FCALL s->state = 4448 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1385] FCALL s->init_num = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL s->s3 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR, FCALL (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=4384, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->s3={-2012874240:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4432, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] state = s->state [L1133] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR, FCALL s->state VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=1073741824, s={-1846547686:0}, s={-1846547686:0}, s->state=4448, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=0, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={1:0}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-939132607:0}, ret=0, s={-1846547686:0}, s={-1846547686:0}, skip=0, SSLv3_client_data={-939142847:0}, state=4448, tmp=0, tmp___0={-939132607:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 383 locations, 1 error locations. UNSAFE Result, 145.8s OverallTime, 28 OverallIterations, 7 TraceHistogramMax, 105.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11451 SDtfs, 34472 SDslu, 65325 SDs, 0 SdLazy, 48321 SolverSat, 3815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10388 GetRequests, 9802 SyntacticMatches, 29 SemanticMatches, 557 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 25.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34773occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 224832 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 6915 NumberOfCodeBlocks, 6915 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 10062 ConstructedInterpolants, 93 QuantifiedInterpolants, 14100962 SizeOfPredicates, 218 NumberOfNonLiveVariables, 9852 ConjunctsInSsa, 328 ConjunctsInUnsatCore, 40 InterpolantComputations, 15 PerfectInterpolantSequences, 9941/11086 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...