./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_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:47:36,852 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:47:36,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:47:36,865 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:47:36,865 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:47:36,867 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:47:36,868 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:47:36,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:47:36,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:47:36,872 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:47:36,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:47:36,873 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:47:36,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:47:36,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:47:36,877 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:47:36,877 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:47:36,878 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:47:36,882 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:47:36,884 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:47:36,885 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:47:36,886 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:47:36,887 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:47:36,889 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:47:36,889 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:47:36,889 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:47:36,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:47:36,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:47:36,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:47:36,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:47:36,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:47:36,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:47:36,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:47:36,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:47:36,903 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:47:36,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:47:36,906 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:47:36,907 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 22:47:36,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:47:36,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:47:36,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:47:36,926 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:47:36,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:47:36,928 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:47:36,928 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:47:36,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:47:36,929 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:47:36,929 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 22:47:36,929 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:47:36,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:47:36,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:47:36,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:47:36,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:47:36,930 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:47:36,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:47:36,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:47:36,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:47:36,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:47:36,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:47:36,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 22:47:36,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:47:36,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 22:47:36,932 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_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:47:36,967 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:47:36,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:47:36,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:47:36,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:47:36,982 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:47:36,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-10-26 22:47:37,037 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/7c9fe126f/88be9067fb724eda8c1b3c631e1ce02e/FLAG4e3be850c [2018-10-26 22:47:37,547 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:47:37,547 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-10-26 22:47:37,563 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/7c9fe126f/88be9067fb724eda8c1b3c631e1ce02e/FLAG4e3be850c [2018-10-26 22:47:37,579 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/7c9fe126f/88be9067fb724eda8c1b3c631e1ce02e [2018-10-26 22:47:37,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:47:37,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:47:37,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:47:37,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:47:37,593 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:47:37,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:47:37" (1/1) ... [2018-10-26 22:47:37,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2316549c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:37, skipping insertion in model container [2018-10-26 22:47:37,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:47:37" (1/1) ... [2018-10-26 22:47:37,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:47:37,691 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:47:38,314 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:47:38,332 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:47:38,604 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:47:38,625 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:47:38,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38 WrapperNode [2018-10-26 22:47:38,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:47:38,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:47:38,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:47:38,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:47:38,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... [2018-10-26 22:47:38,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:47:38,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:47:38,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:47:38,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:47:38,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:47:38,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:47:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:47:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-10-26 22:47:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-10-26 22:47:38,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:47:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 22:47:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-10-26 22:47:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-10-26 22:47:38,986 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-10-26 22:47:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 22:47:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 22:47:38,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 22:47:38,987 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-10-26 22:47:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-10-26 22:47:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 22:47:38,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:47:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 22:47:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:47:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 22:47:39,933 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 22:47:39,933 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 22:47:41,507 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:47:41,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:47:41 BoogieIcfgContainer [2018-10-26 22:47:41,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:47:41,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:47:41,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:47:41,512 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:47:41,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:47:37" (1/3) ... [2018-10-26 22:47:41,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68830b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:47:41, skipping insertion in model container [2018-10-26 22:47:41,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:47:38" (2/3) ... [2018-10-26 22:47:41,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68830b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:47:41, skipping insertion in model container [2018-10-26 22:47:41,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:47:41" (3/3) ... [2018-10-26 22:47:41,516 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-10-26 22:47:41,525 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:47:41,534 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:47:41,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:47:41,585 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:47:41,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:47:41,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:47:41,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:47:41,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:47:41,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:47:41,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:47:41,586 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:47:41,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:47:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states. [2018-10-26 22:47:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 22:47:41,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:41,624 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-10-26 22:47:41,626 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:41,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:41,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1847479421, now seen corresponding path program 1 times [2018-10-26 22:47:41,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:41,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:41,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:47:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:42,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:47:42,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:47:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:47:42,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:47:42,132 INFO L87 Difference]: Start difference. First operand 351 states. Second operand 3 states. [2018-10-26 22:47:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:42,510 INFO L93 Difference]: Finished difference Result 908 states and 1160 transitions. [2018-10-26 22:47:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:47:42,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-26 22:47:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:42,534 INFO L225 Difference]: With dead ends: 908 [2018-10-26 22:47:42,534 INFO L226 Difference]: Without dead ends: 556 [2018-10-26 22:47:42,539 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-10-26 22:47:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-26 22:47:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2018-10-26 22:47:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-10-26 22:47:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 660 transitions. [2018-10-26 22:47:42,615 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 660 transitions. Word has length 94 [2018-10-26 22:47:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:42,616 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 660 transitions. [2018-10-26 22:47:42,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:47:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 660 transitions. [2018-10-26 22:47:42,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 22:47:42,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:42,621 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-10-26 22:47:42,621 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:42,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash 791639565, now seen corresponding path program 1 times [2018-10-26 22:47:42,622 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:42,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:42,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:42,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:42,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:47:42,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:42,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:42,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:42,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:42,909 INFO L87 Difference]: Start difference. First operand 556 states and 660 transitions. Second operand 4 states. [2018-10-26 22:47:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:43,707 INFO L93 Difference]: Finished difference Result 866 states and 1041 transitions. [2018-10-26 22:47:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:43,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-10-26 22:47:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:43,715 INFO L225 Difference]: With dead ends: 866 [2018-10-26 22:47:43,715 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 22:47:43,718 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-10-26 22:47:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 22:47:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 587. [2018-10-26 22:47:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-26 22:47:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2018-10-26 22:47:43,746 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 123 [2018-10-26 22:47:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:43,747 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2018-10-26 22:47:43,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2018-10-26 22:47:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 22:47:43,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:43,753 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-10-26 22:47:43,753 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:43,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1991759122, now seen corresponding path program 1 times [2018-10-26 22:47:43,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:43,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:43,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:43,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:44,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:47:44,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:44,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:47:44,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:47:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:47:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:47:44,301 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2018-10-26 22:47:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:45,167 INFO L93 Difference]: Finished difference Result 1226 states and 1490 transitions. [2018-10-26 22:47:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:47:45,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-10-26 22:47:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:45,171 INFO L225 Difference]: With dead ends: 1226 [2018-10-26 22:47:45,172 INFO L226 Difference]: Without dead ends: 946 [2018-10-26 22:47:45,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:47:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2018-10-26 22:47:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 591. [2018-10-26 22:47:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-26 22:47:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 707 transitions. [2018-10-26 22:47:45,195 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 707 transitions. Word has length 133 [2018-10-26 22:47:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:45,196 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 707 transitions. [2018-10-26 22:47:45,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:47:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 707 transitions. [2018-10-26 22:47:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-26 22:47:45,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:45,202 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-10-26 22:47:45,202 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:45,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:45,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1714735240, now seen corresponding path program 1 times [2018-10-26 22:47:45,203 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:45,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:45,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:45,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:47:45,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:45,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:45,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:45,405 INFO L87 Difference]: Start difference. First operand 591 states and 707 transitions. Second operand 4 states. [2018-10-26 22:47:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:45,969 INFO L93 Difference]: Finished difference Result 923 states and 1116 transitions. [2018-10-26 22:47:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:45,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-10-26 22:47:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:45,972 INFO L225 Difference]: With dead ends: 923 [2018-10-26 22:47:45,973 INFO L226 Difference]: Without dead ends: 639 [2018-10-26 22:47:45,974 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-10-26 22:47:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-26 22:47:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 600. [2018-10-26 22:47:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-26 22:47:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 717 transitions. [2018-10-26 22:47:45,994 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 717 transitions. Word has length 151 [2018-10-26 22:47:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:45,995 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 717 transitions. [2018-10-26 22:47:45,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 717 transitions. [2018-10-26 22:47:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 22:47:45,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:45,998 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-10-26 22:47:45,998 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:45,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:45,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1993983011, now seen corresponding path program 1 times [2018-10-26 22:47:45,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:46,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:47:46,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:46,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:46,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:46,370 INFO L87 Difference]: Start difference. First operand 600 states and 717 transitions. Second operand 4 states. [2018-10-26 22:47:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:47,377 INFO L93 Difference]: Finished difference Result 932 states and 1125 transitions. [2018-10-26 22:47:47,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:47,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-10-26 22:47:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:47,380 INFO L225 Difference]: With dead ends: 932 [2018-10-26 22:47:47,380 INFO L226 Difference]: Without dead ends: 639 [2018-10-26 22:47:47,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-26 22:47:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 602. [2018-10-26 22:47:47,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-26 22:47:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 719 transitions. [2018-10-26 22:47:47,397 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 719 transitions. Word has length 153 [2018-10-26 22:47:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:47,398 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 719 transitions. [2018-10-26 22:47:47,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 719 transitions. [2018-10-26 22:47:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-26 22:47:47,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:47,401 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-10-26 22:47:47,401 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:47,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1728140825, now seen corresponding path program 1 times [2018-10-26 22:47:47,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:47,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:47:47,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:47,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:47:47,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:47:47,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:47:47,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:47:47,547 INFO L87 Difference]: Start difference. First operand 602 states and 719 transitions. Second operand 3 states. [2018-10-26 22:47:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:47,741 INFO L93 Difference]: Finished difference Result 1190 states and 1440 transitions. [2018-10-26 22:47:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:47:47,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-10-26 22:47:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:47,746 INFO L225 Difference]: With dead ends: 1190 [2018-10-26 22:47:47,746 INFO L226 Difference]: Without dead ends: 895 [2018-10-26 22:47:47,753 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-10-26 22:47:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-10-26 22:47:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2018-10-26 22:47:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-26 22:47:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1076 transitions. [2018-10-26 22:47:47,776 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1076 transitions. Word has length 154 [2018-10-26 22:47:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:47,776 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1076 transitions. [2018-10-26 22:47:47,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:47:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1076 transitions. [2018-10-26 22:47:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 22:47:47,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:47,786 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-10-26 22:47:47,786 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:47,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1267260258, now seen corresponding path program 1 times [2018-10-26 22:47:47,787 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:47,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:47,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 22:47:47,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:47,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:47:47,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:47:47,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:47:47,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:47:47,936 INFO L87 Difference]: Start difference. First operand 895 states and 1076 transitions. Second operand 3 states. [2018-10-26 22:47:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:48,265 INFO L93 Difference]: Finished difference Result 1190 states and 1437 transitions. [2018-10-26 22:47:48,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:47:48,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-26 22:47:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:48,270 INFO L225 Difference]: With dead ends: 1190 [2018-10-26 22:47:48,270 INFO L226 Difference]: Without dead ends: 1188 [2018-10-26 22:47:48,271 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-10-26 22:47:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2018-10-26 22:47:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2018-10-26 22:47:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2018-10-26 22:47:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1434 transitions. [2018-10-26 22:47:48,300 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1434 transitions. Word has length 190 [2018-10-26 22:47:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:48,300 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1434 transitions. [2018-10-26 22:47:48,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:47:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1434 transitions. [2018-10-26 22:47:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-26 22:47:48,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:48,305 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-10-26 22:47:48,305 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:48,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1753490078, now seen corresponding path program 1 times [2018-10-26 22:47:48,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:48,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:48,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:48,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:47:48,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:47:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:47:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:47:48,469 INFO L87 Difference]: Start difference. First operand 1188 states and 1434 transitions. Second operand 3 states. [2018-10-26 22:47:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:48,735 INFO L93 Difference]: Finished difference Result 2062 states and 2502 transitions. [2018-10-26 22:47:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:47:48,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-10-26 22:47:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:48,740 INFO L225 Difference]: With dead ends: 2062 [2018-10-26 22:47:48,741 INFO L226 Difference]: Without dead ends: 1181 [2018-10-26 22:47:48,743 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-10-26 22:47:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-10-26 22:47:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2018-10-26 22:47:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-10-26 22:47:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1420 transitions. [2018-10-26 22:47:48,770 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1420 transitions. Word has length 229 [2018-10-26 22:47:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:48,772 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1420 transitions. [2018-10-26 22:47:48,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:47:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1420 transitions. [2018-10-26 22:47:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 22:47:48,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:48,776 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-10-26 22:47:48,776 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:48,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash -466598124, now seen corresponding path program 1 times [2018-10-26 22:47:48,777 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:48,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:48,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:49,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:49,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:49,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:49,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:49,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:49,212 INFO L87 Difference]: Start difference. First operand 1181 states and 1420 transitions. Second operand 4 states. [2018-10-26 22:47:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:50,647 INFO L93 Difference]: Finished difference Result 2646 states and 3219 transitions. [2018-10-26 22:47:50,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:50,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2018-10-26 22:47:50,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:50,663 INFO L225 Difference]: With dead ends: 2646 [2018-10-26 22:47:50,664 INFO L226 Difference]: Without dead ends: 1531 [2018-10-26 22:47:50,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-10-26 22:47:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1353. [2018-10-26 22:47:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2018-10-26 22:47:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1664 transitions. [2018-10-26 22:47:50,698 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1664 transitions. Word has length 233 [2018-10-26 22:47:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:50,699 INFO L481 AbstractCegarLoop]: Abstraction has 1353 states and 1664 transitions. [2018-10-26 22:47:50,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:50,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1664 transitions. [2018-10-26 22:47:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 22:47:50,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:50,705 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-10-26 22:47:50,705 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:50,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash 446462553, now seen corresponding path program 1 times [2018-10-26 22:47:50,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:51,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:51,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:47:51,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:47:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:47:51,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:47:51,003 INFO L87 Difference]: Start difference. First operand 1353 states and 1664 transitions. Second operand 6 states. [2018-10-26 22:47:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:51,873 INFO L93 Difference]: Finished difference Result 4368 states and 5386 transitions. [2018-10-26 22:47:51,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:47:51,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2018-10-26 22:47:51,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:51,885 INFO L225 Difference]: With dead ends: 4368 [2018-10-26 22:47:51,885 INFO L226 Difference]: Without dead ends: 3081 [2018-10-26 22:47:51,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:47:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2018-10-26 22:47:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 1369. [2018-10-26 22:47:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-10-26 22:47:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1680 transitions. [2018-10-26 22:47:51,934 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1680 transitions. Word has length 243 [2018-10-26 22:47:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:51,935 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 1680 transitions. [2018-10-26 22:47:51,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:47:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1680 transitions. [2018-10-26 22:47:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 22:47:51,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:51,942 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-10-26 22:47:51,942 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:51,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash -826404721, now seen corresponding path program 1 times [2018-10-26 22:47:51,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:51,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:51,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:51,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-10-26 22:47:52,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:52,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:52,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:52,317 INFO L87 Difference]: Start difference. First operand 1369 states and 1680 transitions. Second operand 4 states. [2018-10-26 22:47:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:52,986 INFO L93 Difference]: Finished difference Result 3350 states and 4149 transitions. [2018-10-26 22:47:52,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:52,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-10-26 22:47:52,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:52,999 INFO L225 Difference]: With dead ends: 3350 [2018-10-26 22:47:53,000 INFO L226 Difference]: Without dead ends: 2047 [2018-10-26 22:47:53,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2018-10-26 22:47:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1513. [2018-10-26 22:47:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2018-10-26 22:47:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 1880 transitions. [2018-10-26 22:47:53,059 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 1880 transitions. Word has length 261 [2018-10-26 22:47:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:53,059 INFO L481 AbstractCegarLoop]: Abstraction has 1513 states and 1880 transitions. [2018-10-26 22:47:53,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 1880 transitions. [2018-10-26 22:47:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 22:47:53,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:53,067 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-10-26 22:47:53,067 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:53,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash -644582353, now seen corresponding path program 1 times [2018-10-26 22:47:53,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:53,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:53,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:53,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:53,416 INFO L87 Difference]: Start difference. First operand 1513 states and 1880 transitions. Second operand 4 states. [2018-10-26 22:47:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:53,888 INFO L93 Difference]: Finished difference Result 3258 states and 4063 transitions. [2018-10-26 22:47:53,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:53,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2018-10-26 22:47:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:53,901 INFO L225 Difference]: With dead ends: 3258 [2018-10-26 22:47:53,901 INFO L226 Difference]: Without dead ends: 1811 [2018-10-26 22:47:53,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-10-26 22:47:53,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1549. [2018-10-26 22:47:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-10-26 22:47:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 1920 transitions. [2018-10-26 22:47:53,946 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 1920 transitions. Word has length 261 [2018-10-26 22:47:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:53,947 INFO L481 AbstractCegarLoop]: Abstraction has 1549 states and 1920 transitions. [2018-10-26 22:47:53,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1920 transitions. [2018-10-26 22:47:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 22:47:53,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:53,952 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-10-26 22:47:53,952 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:53,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:53,953 INFO L82 PathProgramCache]: Analyzing trace with hash 416932362, now seen corresponding path program 1 times [2018-10-26 22:47:53,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:53,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:53,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:54,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:54,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:54,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:54,333 INFO L87 Difference]: Start difference. First operand 1549 states and 1920 transitions. Second operand 4 states. [2018-10-26 22:47:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:55,079 INFO L93 Difference]: Finished difference Result 3294 states and 4099 transitions. [2018-10-26 22:47:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:55,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2018-10-26 22:47:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:55,087 INFO L225 Difference]: With dead ends: 3294 [2018-10-26 22:47:55,087 INFO L226 Difference]: Without dead ends: 1811 [2018-10-26 22:47:55,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:55,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2018-10-26 22:47:55,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1557. [2018-10-26 22:47:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2018-10-26 22:47:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1928 transitions. [2018-10-26 22:47:55,131 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1928 transitions. Word has length 263 [2018-10-26 22:47:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:55,132 INFO L481 AbstractCegarLoop]: Abstraction has 1557 states and 1928 transitions. [2018-10-26 22:47:55,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1928 transitions. [2018-10-26 22:47:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-26 22:47:55,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:55,137 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-10-26 22:47:55,138 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:55,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:55,138 INFO L82 PathProgramCache]: Analyzing trace with hash -608866290, now seen corresponding path program 1 times [2018-10-26 22:47:55,138 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:55,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:55,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:55,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 249 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 22:47:55,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 22:47:55,457 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:47:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:55,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:47:55,732 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-10-26 22:47:55,744 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-10-26 22:47:55,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:47:55,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:55,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:55,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 22:47:55,960 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-10-26 22:47:56,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:47:56,031 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:47:56,032 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-10-26 22:47:56,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-10-26 22:47:56,451 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-10-26 22:47:56,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:47:56,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:47:56,517 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-10-26 22:47:56,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:47:56,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-10-26 22:47:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:56,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:47:56,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-10-26 22:47:56,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 22:47:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 22:47:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-26 22:47:56,704 INFO L87 Difference]: Start difference. First operand 1557 states and 1928 transitions. Second operand 8 states. [2018-10-26 22:47:58,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:58,738 INFO L93 Difference]: Finished difference Result 4791 states and 5958 transitions. [2018-10-26 22:47:58,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 22:47:58,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 264 [2018-10-26 22:47:58,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:58,750 INFO L225 Difference]: With dead ends: 4791 [2018-10-26 22:47:58,751 INFO L226 Difference]: Without dead ends: 3300 [2018-10-26 22:47:58,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 269 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:47:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2018-10-26 22:47:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2740. [2018-10-26 22:47:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-10-26 22:47:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3435 transitions. [2018-10-26 22:47:58,857 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3435 transitions. Word has length 264 [2018-10-26 22:47:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:58,858 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3435 transitions. [2018-10-26 22:47:58,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 22:47:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3435 transitions. [2018-10-26 22:47:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 22:47:58,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:58,866 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-10-26 22:47:58,866 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:58,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:58,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1210095665, now seen corresponding path program 1 times [2018-10-26 22:47:58,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:58,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:58,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:58,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:58,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:47:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:47:59,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:47:59,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:47:59,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:47:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:47:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:47:59,372 INFO L87 Difference]: Start difference. First operand 2740 states and 3435 transitions. Second operand 4 states. [2018-10-26 22:47:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:47:59,808 INFO L93 Difference]: Finished difference Result 5766 states and 7226 transitions. [2018-10-26 22:47:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:47:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-10-26 22:47:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:47:59,820 INFO L225 Difference]: With dead ends: 5766 [2018-10-26 22:47:59,820 INFO L226 Difference]: Without dead ends: 3092 [2018-10-26 22:47:59,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:47:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2018-10-26 22:47:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2740. [2018-10-26 22:47:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-10-26 22:47:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3427 transitions. [2018-10-26 22:47:59,909 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3427 transitions. Word has length 265 [2018-10-26 22:47:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:47:59,909 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3427 transitions. [2018-10-26 22:47:59,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:47:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3427 transitions. [2018-10-26 22:47:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 22:47:59,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:47:59,917 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-10-26 22:47:59,917 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:47:59,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:47:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash 525585509, now seen corresponding path program 1 times [2018-10-26 22:47:59,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:47:59,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:47:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:59,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:47:59,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:47:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:00,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:00,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:48:00,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:48:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:48:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:48:00,289 INFO L87 Difference]: Start difference. First operand 2740 states and 3427 transitions. Second operand 4 states. [2018-10-26 22:48:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:01,239 INFO L93 Difference]: Finished difference Result 5766 states and 7210 transitions. [2018-10-26 22:48:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:48:01,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-10-26 22:48:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:01,252 INFO L225 Difference]: With dead ends: 5766 [2018-10-26 22:48:01,252 INFO L226 Difference]: Without dead ends: 3092 [2018-10-26 22:48:01,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:48:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3092 states. [2018-10-26 22:48:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3092 to 2740. [2018-10-26 22:48:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2740 states. [2018-10-26 22:48:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3419 transitions. [2018-10-26 22:48:01,332 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3419 transitions. Word has length 265 [2018-10-26 22:48:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:01,333 INFO L481 AbstractCegarLoop]: Abstraction has 2740 states and 3419 transitions. [2018-10-26 22:48:01,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:48:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3419 transitions. [2018-10-26 22:48:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-26 22:48:01,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:01,341 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-10-26 22:48:01,341 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:01,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -339905229, now seen corresponding path program 1 times [2018-10-26 22:48:01,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:01,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:01,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:01,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:48:01,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:48:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:48:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:48:01,725 INFO L87 Difference]: Start difference. First operand 2740 states and 3419 transitions. Second operand 4 states. [2018-10-26 22:48:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:02,328 INFO L93 Difference]: Finished difference Result 5718 states and 7138 transitions. [2018-10-26 22:48:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:48:02,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2018-10-26 22:48:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:02,348 INFO L225 Difference]: With dead ends: 5718 [2018-10-26 22:48:02,349 INFO L226 Difference]: Without dead ends: 3044 [2018-10-26 22:48:02,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:48:02,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-10-26 22:48:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2756. [2018-10-26 22:48:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-10-26 22:48:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3435 transitions. [2018-10-26 22:48:02,424 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3435 transitions. Word has length 266 [2018-10-26 22:48:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:02,425 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 3435 transitions. [2018-10-26 22:48:02,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:48:02,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3435 transitions. [2018-10-26 22:48:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-26 22:48:02,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:02,432 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-10-26 22:48:02,432 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:02,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -237694144, now seen corresponding path program 1 times [2018-10-26 22:48:02,433 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:02,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:02,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:02,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:48:02,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:48:02,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:48:02,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:48:02,706 INFO L87 Difference]: Start difference. First operand 2756 states and 3435 transitions. Second operand 4 states. [2018-10-26 22:48:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:02,993 INFO L93 Difference]: Finished difference Result 5682 states and 7086 transitions. [2018-10-26 22:48:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:48:03,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-26 22:48:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:03,025 INFO L225 Difference]: With dead ends: 5682 [2018-10-26 22:48:03,025 INFO L226 Difference]: Without dead ends: 2992 [2018-10-26 22:48:03,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:48:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-10-26 22:48:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2756. [2018-10-26 22:48:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2018-10-26 22:48:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3427 transitions. [2018-10-26 22:48:03,098 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3427 transitions. Word has length 267 [2018-10-26 22:48:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:03,099 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 3427 transitions. [2018-10-26 22:48:03,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:48:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3427 transitions. [2018-10-26 22:48:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-26 22:48:03,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:03,106 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-10-26 22:48:03,107 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:03,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1771055957, now seen corresponding path program 1 times [2018-10-26 22:48:03,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:03,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:03,456 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:03,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:03,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:48:03,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:48:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:48:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:48:03,458 INFO L87 Difference]: Start difference. First operand 2756 states and 3427 transitions. Second operand 4 states. [2018-10-26 22:48:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:04,751 INFO L93 Difference]: Finished difference Result 5682 states and 7070 transitions. [2018-10-26 22:48:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:48:04,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-10-26 22:48:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:04,762 INFO L225 Difference]: With dead ends: 5682 [2018-10-26 22:48:04,763 INFO L226 Difference]: Without dead ends: 2992 [2018-10-26 22:48:04,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:48:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2018-10-26 22:48:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2772. [2018-10-26 22:48:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-10-26 22:48:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3443 transitions. [2018-10-26 22:48:04,841 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3443 transitions. Word has length 267 [2018-10-26 22:48:04,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:04,842 INFO L481 AbstractCegarLoop]: Abstraction has 2772 states and 3443 transitions. [2018-10-26 22:48:04,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:48:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3443 transitions. [2018-10-26 22:48:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 22:48:04,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:04,851 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-10-26 22:48:04,851 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:04,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash -191724816, now seen corresponding path program 1 times [2018-10-26 22:48:04,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:05,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:05,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 22:48:05,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 22:48:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 22:48:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 22:48:05,352 INFO L87 Difference]: Start difference. First operand 2772 states and 3443 transitions. Second operand 4 states. [2018-10-26 22:48:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:05,617 INFO L93 Difference]: Finished difference Result 5642 states and 7010 transitions. [2018-10-26 22:48:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 22:48:05,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2018-10-26 22:48:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:05,623 INFO L225 Difference]: With dead ends: 5642 [2018-10-26 22:48:05,623 INFO L226 Difference]: Without dead ends: 2936 [2018-10-26 22:48:05,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 22:48:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2018-10-26 22:48:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2788. [2018-10-26 22:48:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-10-26 22:48:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3459 transitions. [2018-10-26 22:48:05,695 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3459 transitions. Word has length 269 [2018-10-26 22:48:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:05,695 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3459 transitions. [2018-10-26 22:48:05,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 22:48:05,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3459 transitions. [2018-10-26 22:48:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-26 22:48:05,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:05,703 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-10-26 22:48:05,703 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:05,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash -274811404, now seen corresponding path program 1 times [2018-10-26 22:48:05,704 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:05,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:05,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:05,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:06,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:48:06,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:48:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:48:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:48:06,379 INFO L87 Difference]: Start difference. First operand 2788 states and 3459 transitions. Second operand 6 states. [2018-10-26 22:48:06,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:06,930 INFO L93 Difference]: Finished difference Result 8270 states and 10209 transitions. [2018-10-26 22:48:06,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:48:06,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2018-10-26 22:48:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:06,956 INFO L225 Difference]: With dead ends: 8270 [2018-10-26 22:48:06,957 INFO L226 Difference]: Without dead ends: 5548 [2018-10-26 22:48:06,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:48:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-10-26 22:48:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 2788. [2018-10-26 22:48:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-10-26 22:48:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3451 transitions. [2018-10-26 22:48:07,053 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3451 transitions. Word has length 271 [2018-10-26 22:48:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:07,053 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3451 transitions. [2018-10-26 22:48:07,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:48:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3451 transitions. [2018-10-26 22:48:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-26 22:48:07,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:07,061 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-10-26 22:48:07,061 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash -715471217, now seen corresponding path program 1 times [2018-10-26 22:48:07,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:07,596 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:07,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:07,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 22:48:07,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 22:48:07,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 22:48:07,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 22:48:07,598 INFO L87 Difference]: Start difference. First operand 2788 states and 3451 transitions. Second operand 6 states. [2018-10-26 22:48:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:08,274 INFO L93 Difference]: Finished difference Result 8270 states and 10193 transitions. [2018-10-26 22:48:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:48:08,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2018-10-26 22:48:08,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:08,292 INFO L225 Difference]: With dead ends: 8270 [2018-10-26 22:48:08,292 INFO L226 Difference]: Without dead ends: 5548 [2018-10-26 22:48:08,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 22:48:08,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2018-10-26 22:48:08,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 2788. [2018-10-26 22:48:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2018-10-26 22:48:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3443 transitions. [2018-10-26 22:48:08,393 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3443 transitions. Word has length 273 [2018-10-26 22:48:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:08,394 INFO L481 AbstractCegarLoop]: Abstraction has 2788 states and 3443 transitions. [2018-10-26 22:48:08,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 22:48:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3443 transitions. [2018-10-26 22:48:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 22:48:08,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:08,401 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-10-26 22:48:08,401 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:08,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1564135183, now seen corresponding path program 1 times [2018-10-26 22:48:08,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:08,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-10-26 22:48:08,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:08,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-26 22:48:08,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:48:08,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:48:08,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:48:08,843 INFO L87 Difference]: Start difference. First operand 2788 states and 3443 transitions. Second operand 11 states. [2018-10-26 22:48:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:09,602 INFO L93 Difference]: Finished difference Result 5518 states and 6825 transitions. [2018-10-26 22:48:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 22:48:09,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 274 [2018-10-26 22:48:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:09,606 INFO L225 Difference]: With dead ends: 5518 [2018-10-26 22:48:09,606 INFO L226 Difference]: Without dead ends: 2796 [2018-10-26 22:48:09,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-10-26 22:48:09,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2018-10-26 22:48:09,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2794. [2018-10-26 22:48:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2018-10-26 22:48:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 3449 transitions. [2018-10-26 22:48:09,724 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 3449 transitions. Word has length 274 [2018-10-26 22:48:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:09,725 INFO L481 AbstractCegarLoop]: Abstraction has 2794 states and 3449 transitions. [2018-10-26 22:48:09,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:48:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 3449 transitions. [2018-10-26 22:48:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-26 22:48:09,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:09,731 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-10-26 22:48:09,731 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:09,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1512696722, now seen corresponding path program 1 times [2018-10-26 22:48:09,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 22:48:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 22:48:09,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:09,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 22:48:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:48:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:48:10,137 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:48:10,220 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-10-26 22:48:10,222 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-10-26 22:48:10,224 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-10-26 22:48:10,225 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-10-26 22:48:10,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:48:10 BoogieIcfgContainer [2018-10-26 22:48:10,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:48:10,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:48:10,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:48:10,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:48:10,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:47:41" (3/4) ... [2018-10-26 22:48:10,315 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 22:48:10,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:48:10,316 INFO L168 Benchmark]: Toolchain (without parser) took 32733.47 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.8 MB). Free memory was 958.0 MB in the beginning and 1.3 GB in the end (delta: -313.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:48:10,318 INFO L168 Benchmark]: CDTParser took 0.18 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-10-26 22:48:10,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1042.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 797.0 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:48:10,320 INFO L168 Benchmark]: Boogie Preprocessor took 165.58 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-10-26 22:48:10,320 INFO L168 Benchmark]: RCFGBuilder took 2581.35 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-10-26 22:48:10,321 INFO L168 Benchmark]: TraceAbstraction took 28799.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -228.0 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-10-26 22:48:10,321 INFO L168 Benchmark]: Witness Printer took 7.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:48:10,324 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.18 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 1042.22 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 797.0 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 165.58 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2581.35 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 28799.50 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 277.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -228.0 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * Witness Printer took 7.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 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 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)# - 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, 28.7s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11178 SDtfs, 4836 SDslu, 21956 SDs, 0 SdLazy, 7671 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 346 SyntacticMatches, 42 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 5.7s 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: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 11079 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.6s 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-10-26 22:48:12,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 22:48:12,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 22:48:12,480 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 22:48:12,480 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 22:48:12,481 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 22:48:12,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 22:48:12,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 22:48:12,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 22:48:12,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 22:48:12,488 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 22:48:12,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 22:48:12,489 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 22:48:12,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 22:48:12,491 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 22:48:12,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 22:48:12,493 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 22:48:12,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 22:48:12,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 22:48:12,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 22:48:12,500 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 22:48:12,501 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 22:48:12,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 22:48:12,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 22:48:12,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 22:48:12,505 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 22:48:12,506 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 22:48:12,507 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 22:48:12,508 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 22:48:12,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 22:48:12,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 22:48:12,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 22:48:12,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 22:48:12,511 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 22:48:12,512 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 22:48:12,513 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 22:48:12,513 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-10-26 22:48:12,527 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 22:48:12,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 22:48:12,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 22:48:12,529 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 22:48:12,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 22:48:12,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 22:48:12,530 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 22:48:12,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 22:48:12,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 22:48:12,532 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 22:48:12,533 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 22:48:12,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 22:48:12,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 22:48:12,533 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 22:48:12,533 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 22:48:12,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 22:48:12,534 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 22:48:12,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 22:48:12,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 22:48:12,534 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 22:48:12,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 22:48:12,537 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 22:48:12,537 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-10-26 22:48:12,537 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 22:48:12,537 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 22:48:12,537 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 22:48:12,538 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_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:12,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 22:48:12,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 22:48:12,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 22:48:12,597 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 22:48:12,597 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 22:48:12,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-10-26 22:48:12,650 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/8a4af7b88/f92496c340144febbd1d3b0e71bc0171/FLAG3b01b2dec [2018-10-26 22:48:13,228 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 22:48:13,231 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-10-26 22:48:13,261 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/8a4af7b88/f92496c340144febbd1d3b0e71bc0171/FLAG3b01b2dec [2018-10-26 22:48:13,281 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/data/8a4af7b88/f92496c340144febbd1d3b0e71bc0171 [2018-10-26 22:48:13,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 22:48:13,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 22:48:13,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 22:48:13,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 22:48:13,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 22:48:13,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:48:13" (1/1) ... [2018-10-26 22:48:13,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9aa741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:13, skipping insertion in model container [2018-10-26 22:48:13,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 10:48:13" (1/1) ... [2018-10-26 22:48:13,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 22:48:13,367 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 22:48:14,261 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:48:14,276 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 22:48:14,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 22:48:14,661 INFO L193 MainTranslator]: Completed translation [2018-10-26 22:48:14,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14 WrapperNode [2018-10-26 22:48:14,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 22:48:14,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 22:48:14,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 22:48:14,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 22:48:14,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... [2018-10-26 22:48:14,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 22:48:14,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 22:48:14,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 22:48:14,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 22:48:14,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 22:48:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 22:48:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2018-10-26 22:48:15,004 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2018-10-26 22:48:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 22:48:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 22:48:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2018-10-26 22:48:15,005 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-10-26 22:48:15,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-10-26 22:48:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 22:48:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 22:48:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 22:48:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-10-26 22:48:15,008 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 22:48:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-10-26 22:48:15,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 22:48:15,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-10-26 22:48:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 22:48:15,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 22:48:15,701 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 22:48:15,701 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 22:48:18,446 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 22:48:18,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:48:18 BoogieIcfgContainer [2018-10-26 22:48:18,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 22:48:18,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 22:48:18,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 22:48:18,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 22:48:18,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 10:48:13" (1/3) ... [2018-10-26 22:48:18,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cd18f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:48:18, skipping insertion in model container [2018-10-26 22:48:18,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 10:48:14" (2/3) ... [2018-10-26 22:48:18,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cd18f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 10:48:18, skipping insertion in model container [2018-10-26 22:48:18,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:48:18" (3/3) ... [2018-10-26 22:48:18,453 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-10-26 22:48:18,463 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 22:48:18,471 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 22:48:18,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 22:48:18,514 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 22:48:18,515 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 22:48:18,515 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 22:48:18,515 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 22:48:18,515 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 22:48:18,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 22:48:18,516 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 22:48:18,516 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 22:48:18,516 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 22:48:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states. [2018-10-26 22:48:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 22:48:18,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:18,553 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-10-26 22:48:18,556 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:18,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1216953019, now seen corresponding path program 1 times [2018-10-26 22:48:18,567 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:18,568 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:18,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:18,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:48:18,838 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:48:18,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:18,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:18,865 INFO L87 Difference]: Start difference. First operand 349 states. Second operand 3 states. [2018-10-26 22:48:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:19,176 INFO L93 Difference]: Finished difference Result 906 states and 1158 transitions. [2018-10-26 22:48:19,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:19,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-10-26 22:48:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:19,209 INFO L225 Difference]: With dead ends: 906 [2018-10-26 22:48:19,209 INFO L226 Difference]: Without dead ends: 554 [2018-10-26 22:48:19,216 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-10-26 22:48:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-26 22:48:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2018-10-26 22:48:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-26 22:48:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 658 transitions. [2018-10-26 22:48:19,321 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 658 transitions. Word has length 92 [2018-10-26 22:48:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:19,321 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 658 transitions. [2018-10-26 22:48:19,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:19,322 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 658 transitions. [2018-10-26 22:48:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 22:48:19,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:19,327 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-10-26 22:48:19,328 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:19,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1653274051, now seen corresponding path program 1 times [2018-10-26 22:48:19,329 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:19,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:19,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:19,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 22:48:19,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:19,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:19,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:19,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:19,526 INFO L87 Difference]: Start difference. First operand 554 states and 658 transitions. Second operand 3 states. [2018-10-26 22:48:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:19,719 INFO L93 Difference]: Finished difference Result 1044 states and 1254 transitions. [2018-10-26 22:48:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:19,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-10-26 22:48:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:19,725 INFO L225 Difference]: With dead ends: 1044 [2018-10-26 22:48:19,725 INFO L226 Difference]: Without dead ends: 795 [2018-10-26 22:48:19,727 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-10-26 22:48:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-26 22:48:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2018-10-26 22:48:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-26 22:48:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 946 transitions. [2018-10-26 22:48:19,790 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 946 transitions. Word has length 121 [2018-10-26 22:48:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:19,794 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 946 transitions. [2018-10-26 22:48:19,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 946 transitions. [2018-10-26 22:48:19,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 22:48:19,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:19,806 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-10-26 22:48:19,807 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:19,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1217351889, now seen corresponding path program 1 times [2018-10-26 22:48:19,809 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:19,809 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:19,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:19,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 22:48:20,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:20,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:20,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:20,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:20,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:20,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:20,009 INFO L87 Difference]: Start difference. First operand 795 states and 946 transitions. Second operand 3 states. [2018-10-26 22:48:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:20,273 INFO L93 Difference]: Finished difference Result 1531 states and 1836 transitions. [2018-10-26 22:48:20,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:20,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-10-26 22:48:20,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:20,281 INFO L225 Difference]: With dead ends: 1531 [2018-10-26 22:48:20,281 INFO L226 Difference]: Without dead ends: 1041 [2018-10-26 22:48:20,283 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-10-26 22:48:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-10-26 22:48:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2018-10-26 22:48:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-10-26 22:48:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1240 transitions. [2018-10-26 22:48:20,318 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1240 transitions. Word has length 152 [2018-10-26 22:48:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:20,319 INFO L481 AbstractCegarLoop]: Abstraction has 1041 states and 1240 transitions. [2018-10-26 22:48:20,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1240 transitions. [2018-10-26 22:48:20,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 22:48:20,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:20,324 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-10-26 22:48:20,325 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:20,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash -823217818, now seen corresponding path program 1 times [2018-10-26 22:48:20,326 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:20,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:20,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:20,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 22:48:20,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:48:20,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:20,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:20,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:20,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:20,673 INFO L87 Difference]: Start difference. First operand 1041 states and 1240 transitions. Second operand 3 states. [2018-10-26 22:48:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:20,970 INFO L93 Difference]: Finished difference Result 2019 states and 2420 transitions. [2018-10-26 22:48:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:20,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-26 22:48:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:20,976 INFO L225 Difference]: With dead ends: 2019 [2018-10-26 22:48:20,976 INFO L226 Difference]: Without dead ends: 1283 [2018-10-26 22:48:20,978 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-10-26 22:48:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2018-10-26 22:48:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2018-10-26 22:48:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2018-10-26 22:48:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1530 transitions. [2018-10-26 22:48:21,011 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1530 transitions. Word has length 188 [2018-10-26 22:48:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:21,012 INFO L481 AbstractCegarLoop]: Abstraction has 1283 states and 1530 transitions. [2018-10-26 22:48:21,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1530 transitions. [2018-10-26 22:48:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-26 22:48:21,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:21,017 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-10-26 22:48:21,017 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:21,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash -133889644, now seen corresponding path program 1 times [2018-10-26 22:48:21,020 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:21,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:21,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:21,336 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:21,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:21,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:21,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:21,340 INFO L87 Difference]: Start difference. First operand 1283 states and 1530 transitions. Second operand 3 states. [2018-10-26 22:48:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:21,679 INFO L93 Difference]: Finished difference Result 2254 states and 2696 transitions. [2018-10-26 22:48:21,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:21,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-10-26 22:48:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:21,686 INFO L225 Difference]: With dead ends: 2254 [2018-10-26 22:48:21,686 INFO L226 Difference]: Without dead ends: 1276 [2018-10-26 22:48:21,689 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-10-26 22:48:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-10-26 22:48:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2018-10-26 22:48:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2018-10-26 22:48:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1516 transitions. [2018-10-26 22:48:21,723 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1516 transitions. Word has length 227 [2018-10-26 22:48:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:21,724 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 1516 transitions. [2018-10-26 22:48:21,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1516 transitions. [2018-10-26 22:48:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 22:48:21,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:21,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, 1, 1, 1, 1] [2018-10-26 22:48:21,730 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:21,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -107230582, now seen corresponding path program 1 times [2018-10-26 22:48:21,733 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:21,736 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:21,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:22,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:22,840 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-10-26 22:48:22,847 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-10-26 22:48:22,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:22,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:22,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:22,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:48:22,964 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-10-26 22:48:22,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:22,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:22,990 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-10-26 22:48:22,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:48:23,486 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 22:48:23,508 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-10-26 22:48:23,551 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:23,553 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-10-26 22:48:23,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:23,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:48:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-10-26 22:48:23,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (7)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:48:23,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:23,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 22:48:23,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:48:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:48:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:48:23,880 INFO L87 Difference]: Start difference. First operand 1276 states and 1516 transitions. Second operand 9 states. [2018-10-26 22:48:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:27,730 INFO L93 Difference]: Finished difference Result 3169 states and 3819 transitions. [2018-10-26 22:48:27,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:48:27,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-10-26 22:48:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:27,739 INFO L225 Difference]: With dead ends: 3169 [2018-10-26 22:48:27,739 INFO L226 Difference]: Without dead ends: 1957 [2018-10-26 22:48:27,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:48:27,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2018-10-26 22:48:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1420. [2018-10-26 22:48:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-10-26 22:48:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1716 transitions. [2018-10-26 22:48:27,789 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1716 transitions. Word has length 231 [2018-10-26 22:48:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:27,790 INFO L481 AbstractCegarLoop]: Abstraction has 1420 states and 1716 transitions. [2018-10-26 22:48:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:48:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1716 transitions. [2018-10-26 22:48:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-26 22:48:27,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:27,796 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-10-26 22:48:27,796 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:27,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1014112726, now seen corresponding path program 1 times [2018-10-26 22:48:27,797 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:27,797 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:28,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:28,420 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-10-26 22:48:28,423 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-10-26 22:48:28,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:48:28,457 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-10-26 22:48:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:28,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:28,469 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-10-26 22:48:28,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:48:28,563 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-10-26 22:48:28,576 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:28,576 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-10-26 22:48:28,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:28,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-10-26 22:48:28,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:48:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:28,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:28,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:28,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 22:48:28,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:48:28,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:48:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:48:28,644 INFO L87 Difference]: Start difference. First operand 1420 states and 1716 transitions. Second operand 9 states. [2018-10-26 22:48:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:30,438 INFO L93 Difference]: Finished difference Result 3450 states and 4211 transitions. [2018-10-26 22:48:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:48:30,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2018-10-26 22:48:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:30,449 INFO L225 Difference]: With dead ends: 3450 [2018-10-26 22:48:30,449 INFO L226 Difference]: Without dead ends: 2094 [2018-10-26 22:48:30,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-26 22:48:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-10-26 22:48:30,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1608. [2018-10-26 22:48:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2018-10-26 22:48:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 1984 transitions. [2018-10-26 22:48:30,521 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 1984 transitions. Word has length 231 [2018-10-26 22:48:30,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:30,522 INFO L481 AbstractCegarLoop]: Abstraction has 1608 states and 1984 transitions. [2018-10-26 22:48:30,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:48:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 1984 transitions. [2018-10-26 22:48:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-26 22:48:30,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:30,529 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-10-26 22:48:30,529 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:30,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:30,530 INFO L82 PathProgramCache]: Analyzing trace with hash 203424325, now seen corresponding path program 1 times [2018-10-26 22:48:30,530 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:30,530 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:30,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:31,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:31,100 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-10-26 22:48:31,102 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-10-26 22:48:31,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:48:31,136 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-10-26 22:48:31,141 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:31,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:31,143 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-10-26 22:48:31,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:48:31,197 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-10-26 22:48:31,199 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:31,200 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-10-26 22:48:31,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:31,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:48:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-10-26 22:48:31,266 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:31,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:31,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-26 22:48:31,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 22:48:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 22:48:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 22:48:31,270 INFO L87 Difference]: Start difference. First operand 1608 states and 1984 transitions. Second operand 9 states. [2018-10-26 22:48:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:33,010 INFO L93 Difference]: Finished difference Result 3610 states and 4445 transitions. [2018-10-26 22:48:33,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 22:48:33,015 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 233 [2018-10-26 22:48:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:33,023 INFO L225 Difference]: With dead ends: 3610 [2018-10-26 22:48:33,023 INFO L226 Difference]: Without dead ends: 2066 [2018-10-26 22:48:33,026 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-10-26 22:48:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-10-26 22:48:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1616. [2018-10-26 22:48:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-10-26 22:48:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1992 transitions. [2018-10-26 22:48:33,082 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1992 transitions. Word has length 233 [2018-10-26 22:48:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:33,082 INFO L481 AbstractCegarLoop]: Abstraction has 1616 states and 1992 transitions. [2018-10-26 22:48:33,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 22:48:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1992 transitions. [2018-10-26 22:48:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-26 22:48:33,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:33,089 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-10-26 22:48:33,089 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:33,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1935717201, now seen corresponding path program 1 times [2018-10-26 22:48:33,090 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:33,090 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:33,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:33,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:33,783 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-10-26 22:48:33,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:48:33,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:33,814 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:33,815 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-10-26 22:48:33,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 22:48:33,839 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-10-26 22:48:33,841 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-10-26 22:48:33,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:48:33,870 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-10-26 22:48:33,875 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:33,877 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-10-26 22:48:33,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:33,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:14 [2018-10-26 22:48:34,000 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-10-26 22:48:34,014 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-10-26 22:48:34,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:48:34,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 23 treesize of output 18 [2018-10-26 22:48:34,072 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,074 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-10-26 22:48:34,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-10-26 22:48:34,284 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,296 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-10-26 22:48:34,320 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,323 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,324 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-10-26 22:48:34,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-10-26 22:48:34,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,442 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:48:34,443 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-10-26 22:48:34,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:48:34,452 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-10-26 22:48:34,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:65, output treesize:52 [2018-10-26 22:48:34,567 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-10-26 22:48:34,583 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-10-26 22:48:34,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,606 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-10-26 22:48:34,609 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-10-26 22:48:34,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,630 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-10-26 22:48:34,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:29 [2018-10-26 22:48:34,706 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-10-26 22:48:34,747 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-10-26 22:48:34,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:34,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:4 [2018-10-26 22:48:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 161 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 22:48:34,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:48:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 165 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-10-26 22:48:35,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:48:35,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 23 [2018-10-26 22:48:35,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:48:35,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:48:35,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:48:35,859 INFO L87 Difference]: Start difference. First operand 1616 states and 1992 transitions. Second operand 23 states. [2018-10-26 22:48:43,537 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-10-26 22:48:43,901 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-10-26 22:48:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:54,099 INFO L93 Difference]: Finished difference Result 11259 states and 14056 transitions. [2018-10-26 22:48:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-26 22:48:54,101 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 241 [2018-10-26 22:48:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:54,129 INFO L225 Difference]: With dead ends: 11259 [2018-10-26 22:48:54,129 INFO L226 Difference]: Without dead ends: 9707 [2018-10-26 22:48:54,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=439, Invalid=1723, Unknown=0, NotChecked=0, Total=2162 [2018-10-26 22:48:54,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2018-10-26 22:48:54,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 5554. [2018-10-26 22:48:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5554 states. [2018-10-26 22:48:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 7070 transitions. [2018-10-26 22:48:54,341 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 7070 transitions. Word has length 241 [2018-10-26 22:48:54,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:54,342 INFO L481 AbstractCegarLoop]: Abstraction has 5554 states and 7070 transitions. [2018-10-26 22:48:54,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:48:54,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 7070 transitions. [2018-10-26 22:48:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-26 22:48:54,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:54,353 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-10-26 22:48:54,354 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:54,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1781473081, now seen corresponding path program 1 times [2018-10-26 22:48:54,356 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:54,356 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:54,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-26 22:48:54,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:54,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:54,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:54,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:54,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:54,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:54,588 INFO L87 Difference]: Start difference. First operand 5554 states and 7070 transitions. Second operand 3 states. [2018-10-26 22:48:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:54,703 INFO L93 Difference]: Finished difference Result 11166 states and 14214 transitions. [2018-10-26 22:48:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:54,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2018-10-26 22:48:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:54,718 INFO L225 Difference]: With dead ends: 11166 [2018-10-26 22:48:54,718 INFO L226 Difference]: Without dead ends: 5676 [2018-10-26 22:48:54,727 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-10-26 22:48:54,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2018-10-26 22:48:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5610. [2018-10-26 22:48:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2018-10-26 22:48:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 7110 transitions. [2018-10-26 22:48:54,972 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 7110 transitions. Word has length 244 [2018-10-26 22:48:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:54,974 INFO L481 AbstractCegarLoop]: Abstraction has 5610 states and 7110 transitions. [2018-10-26 22:48:54,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 7110 transitions. [2018-10-26 22:48:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-26 22:48:54,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:54,985 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-10-26 22:48:54,986 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:54,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash -647482654, now seen corresponding path program 1 times [2018-10-26 22:48:54,987 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:54,988 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:55,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:55,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-10-26 22:48:55,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:48:55,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:48:55,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 22:48:55,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 22:48:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 22:48:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 22:48:55,297 INFO L87 Difference]: Start difference. First operand 5610 states and 7110 transitions. Second operand 3 states. [2018-10-26 22:48:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:55,567 INFO L93 Difference]: Finished difference Result 16555 states and 21013 transitions. [2018-10-26 22:48:55,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 22:48:55,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-10-26 22:48:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:55,596 INFO L225 Difference]: With dead ends: 16555 [2018-10-26 22:48:55,596 INFO L226 Difference]: Without dead ends: 11009 [2018-10-26 22:48:55,606 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-10-26 22:48:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2018-10-26 22:48:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11005. [2018-10-26 22:48:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11005 states. [2018-10-26 22:48:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11005 states to 11005 states and 13922 transitions. [2018-10-26 22:48:55,879 INFO L78 Accepts]: Start accepts. Automaton has 11005 states and 13922 transitions. Word has length 253 [2018-10-26 22:48:55,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:55,879 INFO L481 AbstractCegarLoop]: Abstraction has 11005 states and 13922 transitions. [2018-10-26 22:48:55,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 22:48:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 11005 states and 13922 transitions. [2018-10-26 22:48:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-26 22:48:55,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:55,899 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-10-26 22:48:55,899 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:55,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:55,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1077562714, now seen corresponding path program 1 times [2018-10-26 22:48:55,900 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:55,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:55,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:48:56,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:48:56,123 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-10-26 22:48:56,125 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-10-26 22:48:56,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:48:56,176 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-10-26 22:48:56,187 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-10-26 22:48:56,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:48:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 22:48:56,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:48:56,340 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-10-26 22:48:56,347 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-10-26 22:48:56,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:48:56,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:48:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 22:48:56,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:48:56,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:48:56,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:48:56,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:48:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:48:56,488 INFO L87 Difference]: Start difference. First operand 11005 states and 13922 transitions. Second operand 13 states. [2018-10-26 22:48:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:48:58,844 INFO L93 Difference]: Finished difference Result 22044 states and 27584 transitions. [2018-10-26 22:48:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:48:58,845 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 259 [2018-10-26 22:48:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:48:58,869 INFO L225 Difference]: With dead ends: 22044 [2018-10-26 22:48:58,869 INFO L226 Difference]: Without dead ends: 13424 [2018-10-26 22:48:58,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:48:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13424 states. [2018-10-26 22:48:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13424 to 11491. [2018-10-26 22:48:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11491 states. [2018-10-26 22:48:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11491 states to 11491 states and 14504 transitions. [2018-10-26 22:48:59,314 INFO L78 Accepts]: Start accepts. Automaton has 11491 states and 14504 transitions. Word has length 259 [2018-10-26 22:48:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:48:59,314 INFO L481 AbstractCegarLoop]: Abstraction has 11491 states and 14504 transitions. [2018-10-26 22:48:59,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:48:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 11491 states and 14504 transitions. [2018-10-26 22:48:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-26 22:48:59,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:48:59,329 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-10-26 22:48:59,330 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:48:59,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:48:59,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1774487771, now seen corresponding path program 1 times [2018-10-26 22:48:59,332 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:48:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:48:59,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:48:59,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:00,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:00,127 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-10-26 22:49:00,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:49:00,380 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-10-26 22:49:00,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,387 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-10-26 22:49:00,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-10-26 22:49:00,395 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:00,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:00,397 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-10-26 22:49:00,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 22:49:00,417 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-10-26 22:49:00,428 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-10-26 22:49:00,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:49:00,547 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-10-26 22:49:00,559 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-10-26 22:49:00,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:49:00,877 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-10-26 22:49:00,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:49:00,880 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-10-26 22:49:00,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-10-26 22:49:00,935 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-10-26 22:49:00,939 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-10-26 22:49:00,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:00,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-10-26 22:49:01,018 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-10-26 22:49:01,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:01,023 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:01,024 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-10-26 22:49:01,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:49:01,077 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-10-26 22:49:01,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:01,080 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-10-26 22:49:01,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:49:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:01,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:01,656 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-10-26 22:49:01,715 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-10-26 22:49:01,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,739 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-10-26 22:49:01,760 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-10-26 22:49:01,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:01,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:10 [2018-10-26 22:49:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:04,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:04,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-10-26 22:49:04,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:49:04,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:49:04,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=442, Unknown=1, NotChecked=0, Total=506 [2018-10-26 22:49:04,183 INFO L87 Difference]: Start difference. First operand 11491 states and 14504 transitions. Second operand 23 states. [2018-10-26 22:49:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:13,501 INFO L93 Difference]: Finished difference Result 33278 states and 42071 transitions. [2018-10-26 22:49:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:49:13,502 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 259 [2018-10-26 22:49:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:13,543 INFO L225 Difference]: With dead ends: 33278 [2018-10-26 22:49:13,543 INFO L226 Difference]: Without dead ends: 21856 [2018-10-26 22:49:13,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=199, Invalid=990, Unknown=1, NotChecked=0, Total=1190 [2018-10-26 22:49:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21856 states. [2018-10-26 22:49:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21856 to 13753. [2018-10-26 22:49:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13753 states. [2018-10-26 22:49:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 17618 transitions. [2018-10-26 22:49:14,063 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 17618 transitions. Word has length 259 [2018-10-26 22:49:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:14,063 INFO L481 AbstractCegarLoop]: Abstraction has 13753 states and 17618 transitions. [2018-10-26 22:49:14,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:49:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 17618 transitions. [2018-10-26 22:49:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 22:49:14,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:14,073 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-10-26 22:49:14,073 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:14,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:14,073 INFO L82 PathProgramCache]: Analyzing trace with hash -372553600, now seen corresponding path program 1 times [2018-10-26 22:49:14,074 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:14,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:14,631 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-10-26 22:49:14,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:49:14,678 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-10-26 22:49:14,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,686 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-10-26 22:49:14,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-10-26 22:49:14,743 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:14,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:14,772 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-10-26 22:49:14,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 22:49:14,857 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-10-26 22:49:14,859 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-10-26 22:49:14,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:49:14,956 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-10-26 22:49:14,958 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-10-26 22:49:14,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:14,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:49:14,997 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-10-26 22:49:15,000 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:49:15,000 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-10-26 22:49:15,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-10-26 22:49:15,050 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-10-26 22:49:15,058 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-10-26 22:49:15,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-10-26 22:49:15,159 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-10-26 22:49:15,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:15,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:15,170 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-10-26 22:49:15,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:49:15,223 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-10-26 22:49:15,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:15,226 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-10-26 22:49:15,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:49:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:15,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:15,691 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-10-26 22:49:15,745 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-10-26 22:49:15,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,770 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-10-26 22:49:15,773 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-10-26 22:49:15,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:15,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-10-26 22:49:18,302 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:18,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:18,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-10-26 22:49:18,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-26 22:49:18,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-26 22:49:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=442, Unknown=1, NotChecked=0, Total=506 [2018-10-26 22:49:18,307 INFO L87 Difference]: Start difference. First operand 13753 states and 17618 transitions. Second operand 23 states. [2018-10-26 22:49:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:28,218 INFO L93 Difference]: Finished difference Result 37098 states and 47358 transitions. [2018-10-26 22:49:28,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 22:49:28,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 261 [2018-10-26 22:49:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:28,242 INFO L225 Difference]: With dead ends: 37098 [2018-10-26 22:49:28,242 INFO L226 Difference]: Without dead ends: 23414 [2018-10-26 22:49:28,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 497 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=199, Invalid=990, Unknown=1, NotChecked=0, Total=1190 [2018-10-26 22:49:28,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23414 states. [2018-10-26 22:49:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23414 to 14103. [2018-10-26 22:49:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14103 states. [2018-10-26 22:49:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 18140 transitions. [2018-10-26 22:49:28,716 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 18140 transitions. Word has length 261 [2018-10-26 22:49:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:28,717 INFO L481 AbstractCegarLoop]: Abstraction has 14103 states and 18140 transitions. [2018-10-26 22:49:28,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-26 22:49:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 18140 transitions. [2018-10-26 22:49:28,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 22:49:28,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:28,732 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-10-26 22:49:28,732 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:28,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -602062485, now seen corresponding path program 1 times [2018-10-26 22:49:28,733 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:28,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:28,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:29,063 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-10-26 22:49:29,076 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-10-26 22:49:29,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:29,760 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-10-26 22:49:29,774 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-10-26 22:49:29,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:29,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 22:49:30,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:30,200 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-10-26 22:49:30,203 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-10-26 22:49:30,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:30,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:30,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:30,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:49:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 141 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 22:49:30,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:30,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:49:30,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:49:30,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:49:30,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:30,297 INFO L87 Difference]: Start difference. First operand 14103 states and 18140 transitions. Second operand 13 states. [2018-10-26 22:49:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:32,405 INFO L93 Difference]: Finished difference Result 28278 states and 36030 transitions. [2018-10-26 22:49:32,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:49:32,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 261 [2018-10-26 22:49:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:32,424 INFO L225 Difference]: With dead ends: 28278 [2018-10-26 22:49:32,425 INFO L226 Difference]: Without dead ends: 17010 [2018-10-26 22:49:32,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:49:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2018-10-26 22:49:32,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 14559. [2018-10-26 22:49:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14559 states. [2018-10-26 22:49:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14559 states to 14559 states and 18704 transitions. [2018-10-26 22:49:32,856 INFO L78 Accepts]: Start accepts. Automaton has 14559 states and 18704 transitions. Word has length 261 [2018-10-26 22:49:32,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:32,857 INFO L481 AbstractCegarLoop]: Abstraction has 14559 states and 18704 transitions. [2018-10-26 22:49:32,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:49:32,857 INFO L276 IsEmpty]: Start isEmpty. Operand 14559 states and 18704 transitions. [2018-10-26 22:49:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-26 22:49:32,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:32,867 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-10-26 22:49:32,867 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:32,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash 305725346, now seen corresponding path program 2 times [2018-10-26 22:49:32,868 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:32,868 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:32,882 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-26 22:49:33,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 22:49:33,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 22:49:33,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:33,201 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-10-26 22:49:33,204 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-10-26 22:49:33,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:33,266 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-10-26 22:49:33,268 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-10-26 22:49:33,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 198 proven. 17 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 22:49:33,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:33,346 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-10-26 22:49:33,348 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-10-26 22:49:33,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:33,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:49:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 198 proven. 17 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-26 22:49:33,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:33,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:49:33,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:49:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:49:33,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:33,475 INFO L87 Difference]: Start difference. First operand 14559 states and 18704 transitions. Second operand 13 states. [2018-10-26 22:49:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:35,711 INFO L93 Difference]: Finished difference Result 33746 states and 42906 transitions. [2018-10-26 22:49:35,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:49:35,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 263 [2018-10-26 22:49:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:35,732 INFO L225 Difference]: With dead ends: 33746 [2018-10-26 22:49:35,733 INFO L226 Difference]: Without dead ends: 19256 [2018-10-26 22:49:35,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 517 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:49:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19256 states. [2018-10-26 22:49:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19256 to 16253. [2018-10-26 22:49:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16253 states. [2018-10-26 22:49:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16253 states to 16253 states and 20844 transitions. [2018-10-26 22:49:36,191 INFO L78 Accepts]: Start accepts. Automaton has 16253 states and 20844 transitions. Word has length 263 [2018-10-26 22:49:36,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:36,191 INFO L481 AbstractCegarLoop]: Abstraction has 16253 states and 20844 transitions. [2018-10-26 22:49:36,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:49:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 16253 states and 20844 transitions. [2018-10-26 22:49:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-26 22:49:36,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:36,200 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-10-26 22:49:36,201 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:36,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2079855805, now seen corresponding path program 1 times [2018-10-26 22:49:36,201 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:36,201 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:36,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 22:49:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:36,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:36,490 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-10-26 22:49:36,504 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-10-26 22:49:36,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:36,615 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-10-26 22:49:36,616 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-10-26 22:49:36,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 206 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 22:49:36,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:36,684 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-10-26 22:49:36,686 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-10-26 22:49:36,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:36,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:49:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 206 proven. 19 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 22:49:36,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:36,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:49:36,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:49:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:49:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:36,916 INFO L87 Difference]: Start difference. First operand 16253 states and 20844 transitions. Second operand 13 states. [2018-10-26 22:49:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:39,100 INFO L93 Difference]: Finished difference Result 38068 states and 48236 transitions. [2018-10-26 22:49:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:49:39,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2018-10-26 22:49:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:39,117 INFO L225 Difference]: With dead ends: 38068 [2018-10-26 22:49:39,117 INFO L226 Difference]: Without dead ends: 21884 [2018-10-26 22:49:39,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-10-26 22:49:39,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21884 states. [2018-10-26 22:49:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21884 to 16525. [2018-10-26 22:49:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16525 states. [2018-10-26 22:49:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16525 states to 16525 states and 21160 transitions. [2018-10-26 22:49:39,782 INFO L78 Accepts]: Start accepts. Automaton has 16525 states and 21160 transitions. Word has length 265 [2018-10-26 22:49:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:39,782 INFO L481 AbstractCegarLoop]: Abstraction has 16525 states and 21160 transitions. [2018-10-26 22:49:39,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:49:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 16525 states and 21160 transitions. [2018-10-26 22:49:39,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-26 22:49:39,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:39,791 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-10-26 22:49:39,791 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:39,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:39,791 INFO L82 PathProgramCache]: Analyzing trace with hash -307796730, now seen corresponding path program 1 times [2018-10-26 22:49:39,792 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:39,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:39,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:39,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:39,935 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-10-26 22:49:39,943 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-10-26 22:49:39,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:39,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:39,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:39,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:39,994 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-10-26 22:49:39,997 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-10-26 22:49:39,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:39,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:39,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:40,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 211 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:49:40,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:40,062 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-10-26 22:49:40,066 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-10-26 22:49:40,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:40,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:40,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:40,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:49:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 211 proven. 21 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 22:49:40,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:40,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:49:40,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:49:40,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:49:40,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:40,166 INFO L87 Difference]: Start difference. First operand 16525 states and 21160 transitions. Second operand 13 states. [2018-10-26 22:49:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:43,005 INFO L93 Difference]: Finished difference Result 41830 states and 52796 transitions. [2018-10-26 22:49:43,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 22:49:43,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 267 [2018-10-26 22:49:43,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:43,024 INFO L225 Difference]: With dead ends: 41830 [2018-10-26 22:49:43,024 INFO L226 Difference]: Without dead ends: 25374 [2018-10-26 22:49:43,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-26 22:49:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25374 states. [2018-10-26 22:49:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25374 to 19397. [2018-10-26 22:49:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19397 states. [2018-10-26 22:49:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19397 states to 19397 states and 24810 transitions. [2018-10-26 22:49:43,752 INFO L78 Accepts]: Start accepts. Automaton has 19397 states and 24810 transitions. Word has length 267 [2018-10-26 22:49:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:43,752 INFO L481 AbstractCegarLoop]: Abstraction has 19397 states and 24810 transitions. [2018-10-26 22:49:43,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:49:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19397 states and 24810 transitions. [2018-10-26 22:49:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 22:49:43,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:43,764 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-10-26 22:49:43,764 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:43,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 839425611, now seen corresponding path program 1 times [2018-10-26 22:49:43,765 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:43,765 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:43,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:43,899 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-10-26 22:49:43,901 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-10-26 22:49:43,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:43,947 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-10-26 22:49:43,950 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-10-26 22:49:43,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:43,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 22:49:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 22:49:43,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:44,018 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-10-26 22:49:44,020 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-10-26 22:49:44,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:44,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:44,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:44,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:3 [2018-10-26 22:49:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 215 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-26 22:49:44,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:44,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-10-26 22:49:44,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 22:49:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 22:49:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-26 22:49:44,130 INFO L87 Difference]: Start difference. First operand 19397 states and 24810 transitions. Second operand 13 states. [2018-10-26 22:49:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:49:47,116 INFO L93 Difference]: Finished difference Result 48836 states and 61649 transitions. [2018-10-26 22:49:47,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:49:47,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 269 [2018-10-26 22:49:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:49:47,137 INFO L225 Difference]: With dead ends: 48836 [2018-10-26 22:49:47,138 INFO L226 Difference]: Without dead ends: 29508 [2018-10-26 22:49:47,149 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-10-26 22:49:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29508 states. [2018-10-26 22:49:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29508 to 20043. [2018-10-26 22:49:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20043 states. [2018-10-26 22:49:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20043 states to 20043 states and 25630 transitions. [2018-10-26 22:49:47,727 INFO L78 Accepts]: Start accepts. Automaton has 20043 states and 25630 transitions. Word has length 269 [2018-10-26 22:49:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:49:47,728 INFO L481 AbstractCegarLoop]: Abstraction has 20043 states and 25630 transitions. [2018-10-26 22:49:47,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 22:49:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20043 states and 25630 transitions. [2018-10-26 22:49:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-26 22:49:47,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:49:47,743 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-10-26 22:49:47,743 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:49:47,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:49:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1902782442, now seen corresponding path program 1 times [2018-10-26 22:49:47,744 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:49:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:49:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:49:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:49:48,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:49:48,279 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-10-26 22:49:48,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:49:48,357 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-10-26 22:49:48,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,363 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-10-26 22:49:48,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-10-26 22:49:48,369 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,370 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,371 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-10-26 22:49:48,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 22:49:48,386 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-10-26 22:49:48,388 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-10-26 22:49:48,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:49:48,496 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-10-26 22:49:48,519 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-10-26 22:49:48,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:49:48,627 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-10-26 22:49:48,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:49:48,630 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-10-26 22:49:48,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-10-26 22:49:48,677 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-10-26 22:49:48,680 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-10-26 22:49:48,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-10-26 22:49:48,730 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-10-26 22:49:48,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,734 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-10-26 22:49:48,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:49:48,776 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-10-26 22:49:48,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:49:48,780 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-10-26 22:49:48,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:7 [2018-10-26 22:49:48,823 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-10-26 22:49:48,826 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-10-26 22:49:48,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:49:48,836 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-10-26 22:49:48,837 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-10-26 22:49:48,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:48,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 22:49:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:48,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:49:49,553 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-10-26 22:49:49,599 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-10-26 22:49:49,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:49,619 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-10-26 22:49:49,622 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-10-26 22:49:49,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:49:49,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:49,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:49,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:49:49,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:10 [2018-10-26 22:49:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:49:52,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:49:52,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-10-26 22:49:52,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:49:52,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:49:52,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=628, Unknown=1, NotChecked=0, Total=702 [2018-10-26 22:49:52,078 INFO L87 Difference]: Start difference. First operand 20043 states and 25630 transitions. Second operand 27 states. [2018-10-26 22:50:10,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:10,719 INFO L93 Difference]: Finished difference Result 114824 states and 145178 transitions. [2018-10-26 22:50:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-26 22:50:10,721 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 269 [2018-10-26 22:50:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:10,789 INFO L225 Difference]: With dead ends: 114824 [2018-10-26 22:50:10,789 INFO L226 Difference]: Without dead ends: 94850 [2018-10-26 22:50:10,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 509 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=790, Invalid=4039, Unknown=1, NotChecked=0, Total=4830 [2018-10-26 22:50:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94850 states. [2018-10-26 22:50:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94850 to 20726. [2018-10-26 22:50:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20726 states. [2018-10-26 22:50:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20726 states to 20726 states and 26572 transitions. [2018-10-26 22:50:11,695 INFO L78 Accepts]: Start accepts. Automaton has 20726 states and 26572 transitions. Word has length 269 [2018-10-26 22:50:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:11,695 INFO L481 AbstractCegarLoop]: Abstraction has 20726 states and 26572 transitions. [2018-10-26 22:50:11,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:50:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20726 states and 26572 transitions. [2018-10-26 22:50:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-26 22:50:11,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:11,705 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-10-26 22:50:11,706 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:11,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1273963515, now seen corresponding path program 1 times [2018-10-26 22:50:11,706 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:50:11,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:50:11,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:12,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:12,191 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-10-26 22:50:12,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:50:12,316 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-10-26 22:50:12,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,322 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-10-26 22:50:12,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2018-10-26 22:50:12,333 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,334 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,335 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-10-26 22:50:12,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-10-26 22:50:12,351 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-10-26 22:50:12,353 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-10-26 22:50:12,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-10-26 22:50:12,412 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-10-26 22:50:12,414 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-10-26 22:50:12,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 22:50:12,451 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-10-26 22:50:12,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:50:12,454 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-10-26 22:50:12,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:17 [2018-10-26 22:50:12,502 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-10-26 22:50:12,506 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-10-26 22:50:12,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:13 [2018-10-26 22:50:12,554 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-10-26 22:50:12,556 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,557 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,558 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-10-26 22:50:12,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:50:12,598 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-10-26 22:50:12,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:12,601 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-10-26 22:50:12,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:7 [2018-10-26 22:50:12,643 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-10-26 22:50:12,645 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-10-26 22:50:12,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:50:12,667 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-10-26 22:50:12,669 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-10-26 22:50:12,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:12,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 22:50:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:50:12,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:50:13,336 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-10-26 22:50:13,409 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-10-26 22:50:13,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:13,436 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-10-26 22:50:13,438 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-10-26 22:50:13,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:13,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:13,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:13,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:13,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:10 [2018-10-26 22:50:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-10-26 22:50:15,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:50:15,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-10-26 22:50:15,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 22:50:15,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 22:50:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=628, Unknown=1, NotChecked=0, Total=702 [2018-10-26 22:50:15,768 INFO L87 Difference]: Start difference. First operand 20726 states and 26572 transitions. Second operand 27 states. [2018-10-26 22:50:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:34,117 INFO L93 Difference]: Finished difference Result 116401 states and 147235 transitions. [2018-10-26 22:50:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-26 22:50:34,118 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 271 [2018-10-26 22:50:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:34,181 INFO L225 Difference]: With dead ends: 116401 [2018-10-26 22:50:34,181 INFO L226 Difference]: Without dead ends: 95744 [2018-10-26 22:50:34,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 513 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=790, Invalid=4039, Unknown=1, NotChecked=0, Total=4830 [2018-10-26 22:50:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95744 states. [2018-10-26 22:50:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95744 to 20211. [2018-10-26 22:50:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20211 states. [2018-10-26 22:50:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20211 states to 20211 states and 25832 transitions. [2018-10-26 22:50:35,126 INFO L78 Accepts]: Start accepts. Automaton has 20211 states and 25832 transitions. Word has length 271 [2018-10-26 22:50:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:35,126 INFO L481 AbstractCegarLoop]: Abstraction has 20211 states and 25832 transitions. [2018-10-26 22:50:35,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 22:50:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 20211 states and 25832 transitions. [2018-10-26 22:50:35,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-26 22:50:35,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:35,136 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-10-26 22:50:35,136 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:35,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1338838841, now seen corresponding path program 1 times [2018-10-26 22:50:35,137 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:50:35,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:50:35,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:35,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:35,633 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-10-26 22:50:35,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:50:35,657 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:35,659 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:35,659 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-10-26 22:50:35,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-10-26 22:50:35,680 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-10-26 22:50:35,682 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-10-26 22:50:35,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-10-26 22:50:35,806 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-26 22:50:35,812 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-10-26 22:50:35,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-10-26 22:50:35,849 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-10-26 22:50:35,852 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:35,854 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-10-26 22:50:35,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:50:35,947 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-10-26 22:50:35,950 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-10-26 22:50:35,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:35,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-10-26 22:50:36,004 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-10-26 22:50:36,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,015 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-10-26 22:50:36,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:50 [2018-10-26 22:50:36,065 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,069 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-10-26 22:50:36,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2018-10-26 22:50:36,166 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-10-26 22:50:36,170 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-10-26 22:50:36,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,200 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-10-26 22:50:36,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-10-26 22:50:36,280 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-10-26 22:50:36,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:36,293 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-10-26 22:50:36,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,337 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-10-26 22:50:36,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-10-26 22:50:36,389 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-10-26 22:50:36,393 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-10-26 22:50:36,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,405 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-10-26 22:50:36,405 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:36,423 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-10-26 22:50:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-26 22:50:36,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:50:36,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:50:36,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:50:36,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:50:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:50:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:50:36,573 INFO L87 Difference]: Start difference. First operand 20211 states and 25832 transitions. Second operand 15 states. [2018-10-26 22:50:37,870 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-10-26 22:50:38,420 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-26 22:50:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:41,383 INFO L93 Difference]: Finished difference Result 36916 states and 47150 transitions. [2018-10-26 22:50:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:50:41,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 272 [2018-10-26 22:50:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:41,399 INFO L225 Difference]: With dead ends: 36916 [2018-10-26 22:50:41,399 INFO L226 Difference]: Without dead ends: 20608 [2018-10-26 22:50:41,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-10-26 22:50:41,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20608 states. [2018-10-26 22:50:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20608 to 20243. [2018-10-26 22:50:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20243 states. [2018-10-26 22:50:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 25874 transitions. [2018-10-26 22:50:42,097 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 25874 transitions. Word has length 272 [2018-10-26 22:50:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:42,098 INFO L481 AbstractCegarLoop]: Abstraction has 20243 states and 25874 transitions. [2018-10-26 22:50:42,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:50:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 25874 transitions. [2018-10-26 22:50:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 22:50:42,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:42,108 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-10-26 22:50:42,108 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:42,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 240674964, now seen corresponding path program 1 times [2018-10-26 22:50:42,109 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:50:42,109 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:50:42,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:42,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:42,614 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-10-26 22:50:42,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:50:42,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,651 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-10-26 22:50:42,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-10-26 22:50:42,671 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-10-26 22:50:42,673 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-10-26 22:50:42,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-10-26 22:50:42,705 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-10-26 22:50:42,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-10-26 22:50:42,741 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-10-26 22:50:42,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,746 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-10-26 22:50:42,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:50:42,836 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-10-26 22:50:42,838 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-10-26 22:50:42,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-10-26 22:50:42,883 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-10-26 22:50:42,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,889 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-10-26 22:50:42,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:50 [2018-10-26 22:50:42,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:42,955 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-10-26 22:50:42,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:42,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:43 [2018-10-26 22:50:43,043 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-10-26 22:50:43,047 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-10-26 22:50:43,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,072 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-10-26 22:50:43,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-10-26 22:50:43,228 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-10-26 22:50:43,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:43,292 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-10-26 22:50:43,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,659 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-10-26 22:50:43,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-10-26 22:50:43,846 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-10-26 22:50:43,850 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-10-26 22:50:43,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,860 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-10-26 22:50:43,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:43,875 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-10-26 22:50:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-26 22:50:43,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:50:43,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:50:43,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:50:43,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:50:43,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:50:43,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:50:43,971 INFO L87 Difference]: Start difference. First operand 20243 states and 25874 transitions. Second operand 15 states. [2018-10-26 22:50:45,031 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-10-26 22:50:45,572 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-26 22:50:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:48,337 INFO L93 Difference]: Finished difference Result 36906 states and 47138 transitions. [2018-10-26 22:50:48,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:50:48,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 274 [2018-10-26 22:50:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:48,351 INFO L225 Difference]: With dead ends: 36906 [2018-10-26 22:50:48,351 INFO L226 Difference]: Without dead ends: 20598 [2018-10-26 22:50:48,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 258 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-10-26 22:50:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-10-26 22:50:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-10-26 22:50:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-10-26 22:50:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25878 transitions. [2018-10-26 22:50:49,042 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25878 transitions. Word has length 274 [2018-10-26 22:50:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:49,042 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25878 transitions. [2018-10-26 22:50:49,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:50:49,042 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25878 transitions. [2018-10-26 22:50:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-26 22:50:49,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:49,056 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-10-26 22:50:49,056 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:49,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1904549196, now seen corresponding path program 1 times [2018-10-26 22:50:49,057 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:50:49,057 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:50:49,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:49,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:49,557 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-10-26 22:50:49,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:50:49,573 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,575 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-10-26 22:50:49,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-10-26 22:50:49,598 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-10-26 22:50:49,600 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-10-26 22:50:49,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-10-26 22:50:49,633 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-10-26 22:50:49,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-10-26 22:50:49,667 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-10-26 22:50:49,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,673 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-10-26 22:50:49,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:50:49,779 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-10-26 22:50:49,781 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-10-26 22:50:49,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-10-26 22:50:49,826 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-10-26 22:50:49,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,841 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-10-26 22:50:49,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:48 [2018-10-26 22:50:49,889 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,891 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,892 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,893 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:49,893 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-10-26 22:50:49,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:43 [2018-10-26 22:50:49,983 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-10-26 22:50:49,987 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-10-26 22:50:49,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:49,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,012 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-10-26 22:50:50,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-10-26 22:50:50,078 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-10-26 22:50:50,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:50,086 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-10-26 22:50:50,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,136 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-10-26 22:50:50,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-10-26 22:50:50,175 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-10-26 22:50:50,190 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-10-26 22:50:50,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,200 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-10-26 22:50:50,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:50,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-10-26 22:50:50,313 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 22:50:50,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:50:50,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:50:50,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:50:50,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:50:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:50:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:50:50,318 INFO L87 Difference]: Start difference. First operand 20247 states and 25878 transitions. Second operand 15 states. [2018-10-26 22:50:51,143 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 22:50:51,889 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-10-26 22:50:52,278 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-26 22:50:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:50:55,840 INFO L93 Difference]: Finished difference Result 40740 states and 52044 transitions. [2018-10-26 22:50:55,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:50:55,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 300 [2018-10-26 22:50:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:50:55,855 INFO L225 Difference]: With dead ends: 40740 [2018-10-26 22:50:55,855 INFO L226 Difference]: Without dead ends: 20598 [2018-10-26 22:50:55,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 284 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-10-26 22:50:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-10-26 22:50:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-10-26 22:50:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-10-26 22:50:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25876 transitions. [2018-10-26 22:50:56,662 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25876 transitions. Word has length 300 [2018-10-26 22:50:56,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:50:56,662 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25876 transitions. [2018-10-26 22:50:56,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:50:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25876 transitions. [2018-10-26 22:50:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-26 22:50:56,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:50:56,673 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-10-26 22:50:56,673 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:50:56,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:50:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash -975652721, now seen corresponding path program 1 times [2018-10-26 22:50:56,674 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:50:56,674 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:50:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:50:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:50:57,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:50:57,155 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-10-26 22:50:57,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 22:50:57,181 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,183 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,183 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-10-26 22:50:57,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:20 [2018-10-26 22:50:57,206 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-10-26 22:50:57,208 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-10-26 22:50:57,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-10-26 22:50:57,240 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-10-26 22:50:57,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:35 [2018-10-26 22:50:57,276 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-10-26 22:50:57,287 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,290 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-10-26 22:50:57,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-26 22:50:57,487 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-10-26 22:50:57,489 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-10-26 22:50:57,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-10-26 22:50:57,534 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-10-26 22:50:57,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,540 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-10-26 22:50:57,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:48 [2018-10-26 22:50:57,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,591 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,593 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-10-26 22:50:57,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:43 [2018-10-26 22:50:57,682 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-10-26 22:50:57,686 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-10-26 22:50:57,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,711 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-10-26 22:50:57,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-10-26 22:50:57,774 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-10-26 22:50:57,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:50:57,787 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-10-26 22:50:57,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,828 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-10-26 22:50:57,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:48 [2018-10-26 22:50:57,915 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-10-26 22:50:57,919 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-10-26 22:50:57,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,930 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-10-26 22:50:57,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:50:57,947 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:15 [2018-10-26 22:50:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-26 22:50:58,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 22:50:58,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 22:50:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 22:50:58,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:50:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:50:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:50:58,040 INFO L87 Difference]: Start difference. First operand 20247 states and 25876 transitions. Second operand 15 states. [2018-10-26 22:50:59,158 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2018-10-26 22:50:59,506 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-26 22:51:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:51:02,293 INFO L93 Difference]: Finished difference Result 40740 states and 52042 transitions. [2018-10-26 22:51:02,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 22:51:02,294 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 302 [2018-10-26 22:51:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:51:02,308 INFO L225 Difference]: With dead ends: 40740 [2018-10-26 22:51:02,308 INFO L226 Difference]: Without dead ends: 20598 [2018-10-26 22:51:02,320 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-10-26 22:51:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20598 states. [2018-10-26 22:51:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20598 to 20247. [2018-10-26 22:51:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20247 states. [2018-10-26 22:51:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20247 states to 20247 states and 25874 transitions. [2018-10-26 22:51:03,193 INFO L78 Accepts]: Start accepts. Automaton has 20247 states and 25874 transitions. Word has length 302 [2018-10-26 22:51:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:51:03,193 INFO L481 AbstractCegarLoop]: Abstraction has 20247 states and 25874 transitions. [2018-10-26 22:51:03,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:51:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20247 states and 25874 transitions. [2018-10-26 22:51:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 22:51:03,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:51:03,203 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-10-26 22:51:03,203 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:51:03,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:51:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1687043427, now seen corresponding path program 1 times [2018-10-26 22:51:03,204 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:51:03,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:51:03,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:51:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:51:03,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:51:03,685 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-10-26 22:51:03,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,690 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-10-26 22:51:03,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-26 22:51:03,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 33 treesize of output 26 [2018-10-26 22:51:03,728 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,729 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,730 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,732 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,732 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-10-26 22:51:03,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-10-26 22:51:03,781 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-10-26 22:51:03,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,836 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,838 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,839 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,844 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-10-26 22:51:03,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-10-26 22:51:03,904 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,905 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-10-26 22:51:03,909 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,920 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-10-26 22:51:03,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:03,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:41 [2018-10-26 22:51:03,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 22:51:03,978 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-10-26 22:51:03,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:03,993 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-10-26 22:51:03,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:41 [2018-10-26 22:51:04,047 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-10-26 22:51:04,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:04,080 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-10-26 22:51:04,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:04,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:4 [2018-10-26 22:51:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 297 proven. 21 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-10-26 22:51:04,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:51:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 297 proven. 1 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-10-26 22:51:04,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 22:51:04,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 15 [2018-10-26 22:51:04,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 22:51:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 22:51:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-26 22:51:04,304 INFO L87 Difference]: Start difference. First operand 20247 states and 25874 transitions. Second operand 15 states. [2018-10-26 22:51:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:51:08,953 INFO L93 Difference]: Finished difference Result 63365 states and 80530 transitions. [2018-10-26 22:51:08,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 22:51:08,955 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2018-10-26 22:51:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:51:08,987 INFO L225 Difference]: With dead ends: 63365 [2018-10-26 22:51:08,987 INFO L226 Difference]: Without dead ends: 43223 [2018-10-26 22:51:09,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 592 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2018-10-26 22:51:09,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43223 states. [2018-10-26 22:51:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43223 to 32965. [2018-10-26 22:51:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32965 states. [2018-10-26 22:51:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32965 states to 32965 states and 42506 transitions. [2018-10-26 22:51:10,347 INFO L78 Accepts]: Start accepts. Automaton has 32965 states and 42506 transitions. Word has length 303 [2018-10-26 22:51:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:51:10,348 INFO L481 AbstractCegarLoop]: Abstraction has 32965 states and 42506 transitions. [2018-10-26 22:51:10,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 22:51:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32965 states and 42506 transitions. [2018-10-26 22:51:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-26 22:51:10,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:51:10,365 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-10-26 22:51:10,365 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:51:10,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:51:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash 292220355, now seen corresponding path program 1 times [2018-10-26 22:51:10,366 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:51:10,366 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:51:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:51:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 22:51:10,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 22:51:10,878 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-10-26 22:51:10,879 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-10-26 22:51:10,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 22:51:10,903 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-10-26 22:51:10,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:10,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:10,907 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-10-26 22:51:10,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 22:51:10,959 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-10-26 22:51:10,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 22:51:10,962 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-10-26 22:51:10,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 22:51:10,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-10-26 22:51:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 222 proven. 1 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-26 22:51:11,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 22:51:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-10-26 22:51:11,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 22:51:11,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-10-26 22:51:11,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 22:51:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 22:51:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-26 22:51:11,077 INFO L87 Difference]: Start difference. First operand 32965 states and 42506 transitions. Second operand 11 states. [2018-10-26 22:51:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 22:51:14,041 INFO L93 Difference]: Finished difference Result 73752 states and 94425 transitions. [2018-10-26 22:51:14,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 22:51:14,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 303 [2018-10-26 22:51:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 22:51:14,074 INFO L225 Difference]: With dead ends: 73752 [2018-10-26 22:51:14,074 INFO L226 Difference]: Without dead ends: 46974 [2018-10-26 22:51:14,087 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-10-26 22:51:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46974 states. [2018-10-26 22:51:15,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46974 to 34773. [2018-10-26 22:51:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34773 states. [2018-10-26 22:51:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34773 states to 34773 states and 44612 transitions. [2018-10-26 22:51:15,375 INFO L78 Accepts]: Start accepts. Automaton has 34773 states and 44612 transitions. Word has length 303 [2018-10-26 22:51:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 22:51:15,376 INFO L481 AbstractCegarLoop]: Abstraction has 34773 states and 44612 transitions. [2018-10-26 22:51:15,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 22:51:15,376 INFO L276 IsEmpty]: Start isEmpty. Operand 34773 states and 44612 transitions. [2018-10-26 22:51:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-26 22:51:15,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 22:51:15,394 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-10-26 22:51:15,394 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 22:51:15,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 22:51:15,394 INFO L82 PathProgramCache]: Analyzing trace with hash 459427510, now seen corresponding path program 1 times [2018-10-26 22:51:15,395 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 22:51:15,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/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-10-26 22:51:15,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 22:51:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 22:51:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (29)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 22:51:16,969 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 22:51:17,048 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-10-26 22:51:17,049 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-10-26 22:51:17,050 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-10-26 22:51:17,050 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-10-26 22:51:17,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 10:51:17 BoogieIcfgContainer [2018-10-26 22:51:17,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 22:51:17,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 22:51:17,138 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 22:51:17,138 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 22:51:17,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 10:48:18" (3/4) ... [2018-10-26 22:51:17,144 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 22:51:17,167 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-10-26 22:51:17,167 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-10-26 22:51:17,167 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-10-26 22:51:17,168 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-10-26 22:51:17,265 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6c9f2e29-3dea-497d-b99c-b73e0f7f518f/bin-2019/uautomizer/witness.graphml [2018-10-26 22:51:17,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 22:51:17,266 INFO L168 Benchmark]: Toolchain (without parser) took 183980.63 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 943.8 MB in the beginning and 1.5 GB in the end (delta: -551.7 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-10-26 22:51:17,266 INFO L168 Benchmark]: CDTParser took 0.19 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-10-26 22:51:17,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1374.58 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 782.8 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-10-26 22:51:17,267 INFO L168 Benchmark]: Boogie Preprocessor took 261.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 782.8 MB in the beginning and 1.2 GB in the end (delta: -390.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-10-26 22:51:17,267 INFO L168 Benchmark]: RCFGBuilder took 3521.45 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: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. [2018-10-26 22:51:17,267 INFO L168 Benchmark]: TraceAbstraction took 178690.38 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -425.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-10-26 22:51:17,268 INFO L168 Benchmark]: Witness Printer took 127.62 ms. Allocated memory is still 3.7 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 22:51:17,269 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.19 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 1374.58 ms. Allocated memory is still 1.0 GB. Free memory was 943.8 MB in the beginning and 782.8 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 261.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 782.8 MB in the beginning and 1.2 GB in the end (delta: -390.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3521.45 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: 103.2 MB). Peak memory consumption was 103.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 178690.38 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -425.8 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 127.62 ms. Allocated memory is still 3.7 GB. Free memory is still 1.5 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: 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, 178.6s OverallTime, 28 OverallIterations, 7 TraceHistogramMax, 125.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11451 SDtfs, 34472 SDslu, 65325 SDs, 0 SdLazy, 48321 SolverSat, 3815 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 81.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10388 GetRequests, 9802 SyntacticMatches, 29 SemanticMatches, 557 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3614 ImplicationChecksByTransitivity, 31.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: 12.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 224832 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 6.7s SatisfiabilityAnalysisTime, 29.8s 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...