./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/s3_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/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_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/s3_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/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-0cd3be1 [2018-11-28 13:17:10,966 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:17:10,967 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:17:10,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:17:10,974 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:17:10,975 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:17:10,976 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:17:10,977 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:17:10,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:17:10,978 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:17:10,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:17:10,979 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:17:10,980 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:17:10,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:17:10,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:17:10,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:17:10,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:17:10,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:17:10,985 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:17:10,986 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:17:10,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:17:10,987 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:17:10,989 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:17:10,989 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:17:10,989 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:17:10,990 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:17:10,991 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:17:10,991 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:17:10,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:17:10,992 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:17:10,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:17:10,993 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:17:10,993 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:17:10,993 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:17:10,994 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:17:10,995 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:17:10,995 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:17:11,004 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:17:11,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:17:11,005 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:17:11,005 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:17:11,005 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:17:11,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:17:11,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:17:11,006 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:17:11,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:17:11,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:17:11,008 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:17:11,008 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:17:11,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:11,008 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:17:11,008 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:17:11,008 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:17:11,009 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:17:11,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:17:11,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:17:11,009 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_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-28 13:17:11,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:17:11,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:17:11,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:17:11,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:17:11,043 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:17:11,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-28 13:17:11,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/b3d81dfb4/9b3dfc7bd2ef4c3e9e382d093e87da65/FLAG63048fded [2018-11-28 13:17:11,439 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:17:11,440 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-28 13:17:11,450 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/b3d81dfb4/9b3dfc7bd2ef4c3e9e382d093e87da65/FLAG63048fded [2018-11-28 13:17:11,460 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/b3d81dfb4/9b3dfc7bd2ef4c3e9e382d093e87da65 [2018-11-28 13:17:11,462 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:17:11,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:17:11,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:11,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:17:11,466 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:17:11,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4ae2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11, skipping insertion in model container [2018-11-28 13:17:11,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:17:11,507 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:17:11,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:11,807 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:17:11,879 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:11,894 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:17:11,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11 WrapperNode [2018-11-28 13:17:11,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:11,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:11,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:17:11,895 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:17:11,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:11,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:17:11,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:17:11,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:17:11,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... [2018-11-28 13:17:11,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:17:11,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:17:11,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:17:11,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:17:11,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:17:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:17:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:17:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:17:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:17:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:17:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 13:17:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 13:17:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:17:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:17:12,236 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:17:12,237 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:17:12,796 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:17:12,796 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 13:17:12,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:12 BoogieIcfgContainer [2018-11-28 13:17:12,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:17:12,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:17:12,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:17:12,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:17:12,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:17:11" (1/3) ... [2018-11-28 13:17:12,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440564e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:12, skipping insertion in model container [2018-11-28 13:17:12,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:11" (2/3) ... [2018-11-28 13:17:12,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440564e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:12, skipping insertion in model container [2018-11-28 13:17:12,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:12" (3/3) ... [2018-11-28 13:17:12,801 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-28 13:17:12,808 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:17:12,813 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:17:12,823 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:17:12,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:17:12,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:17:12,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:17:12,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:17:12,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:17:12,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:17:12,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:17:12,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:17:12,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:17:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-11-28 13:17:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:17:12,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:12,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:12,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:12,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:12,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-11-28 13:17:12,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:12,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:12,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:12,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:13,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:13,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:13,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:13,090 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-11-28 13:17:13,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:13,183 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-11-28 13:17:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:13,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 13:17:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:13,196 INFO L225 Difference]: With dead ends: 385 [2018-11-28 13:17:13,196 INFO L226 Difference]: Without dead ends: 223 [2018-11-28 13:17:13,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-28 13:17:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-28 13:17:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-28 13:17:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-11-28 13:17:13,247 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-11-28 13:17:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:13,248 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-11-28 13:17:13,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-11-28 13:17:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:17:13,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:13,250 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:13,250 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:13,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-11-28 13:17:13,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:13,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:13,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:13,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:13,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:13,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:13,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:13,340 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-11-28 13:17:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:13,395 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-11-28 13:17:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:13,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-28 13:17:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:13,397 INFO L225 Difference]: With dead ends: 432 [2018-11-28 13:17:13,398 INFO L226 Difference]: Without dead ends: 325 [2018-11-28 13:17:13,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-28 13:17:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-11-28 13:17:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-28 13:17:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-11-28 13:17:13,415 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-11-28 13:17:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:13,416 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-11-28 13:17:13,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-11-28 13:17:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:17:13,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:13,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:13,419 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:13,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:13,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-11-28 13:17:13,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:13,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:13,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:13,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:13,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:13,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:13,542 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 4 states. [2018-11-28 13:17:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:13,864 INFO L93 Difference]: Finished difference Result 825 states and 1216 transitions. [2018-11-28 13:17:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:13,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 13:17:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:13,867 INFO L225 Difference]: With dead ends: 825 [2018-11-28 13:17:13,867 INFO L226 Difference]: Without dead ends: 513 [2018-11-28 13:17:13,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-28 13:17:13,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 375. [2018-11-28 13:17:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-28 13:17:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 562 transitions. [2018-11-28 13:17:13,888 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 562 transitions. Word has length 63 [2018-11-28 13:17:13,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:13,889 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 562 transitions. [2018-11-28 13:17:13,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 562 transitions. [2018-11-28 13:17:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:17:13,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:13,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:13,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:13,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1956647801, now seen corresponding path program 1 times [2018-11-28 13:17:13,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:13,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:13,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:13,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:13,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:13,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:13,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:13,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:13,986 INFO L87 Difference]: Start difference. First operand 375 states and 562 transitions. Second operand 4 states. [2018-11-28 13:17:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:14,174 INFO L93 Difference]: Finished difference Result 821 states and 1232 transitions. [2018-11-28 13:17:14,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:14,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-28 13:17:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:14,177 INFO L225 Difference]: With dead ends: 821 [2018-11-28 13:17:14,177 INFO L226 Difference]: Without dead ends: 459 [2018-11-28 13:17:14,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-28 13:17:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 415. [2018-11-28 13:17:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-28 13:17:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 630 transitions. [2018-11-28 13:17:14,193 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 630 transitions. Word has length 63 [2018-11-28 13:17:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:14,193 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 630 transitions. [2018-11-28 13:17:14,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 630 transitions. [2018-11-28 13:17:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:17:14,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:14,197 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:14,197 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:14,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash -671506196, now seen corresponding path program 1 times [2018-11-28 13:17:14,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:14,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:14,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:14,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:14,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:14,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:14,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:14,278 INFO L87 Difference]: Start difference. First operand 415 states and 630 transitions. Second operand 4 states. [2018-11-28 13:17:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:14,632 INFO L93 Difference]: Finished difference Result 949 states and 1429 transitions. [2018-11-28 13:17:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:14,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-28 13:17:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:14,637 INFO L225 Difference]: With dead ends: 949 [2018-11-28 13:17:14,639 INFO L226 Difference]: Without dead ends: 547 [2018-11-28 13:17:14,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:14,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-28 13:17:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 417. [2018-11-28 13:17:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-28 13:17:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 632 transitions. [2018-11-28 13:17:14,657 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 632 transitions. Word has length 64 [2018-11-28 13:17:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:14,657 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 632 transitions. [2018-11-28 13:17:14,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 632 transitions. [2018-11-28 13:17:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:17:14,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:14,660 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:14,660 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:14,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:14,660 INFO L82 PathProgramCache]: Analyzing trace with hash 653887364, now seen corresponding path program 1 times [2018-11-28 13:17:14,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:14,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:14,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:14,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:14,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:14,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:14,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:14,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:14,729 INFO L87 Difference]: Start difference. First operand 417 states and 632 transitions. Second operand 4 states. [2018-11-28 13:17:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:14,994 INFO L93 Difference]: Finished difference Result 951 states and 1429 transitions. [2018-11-28 13:17:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:14,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-28 13:17:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:14,997 INFO L225 Difference]: With dead ends: 951 [2018-11-28 13:17:14,997 INFO L226 Difference]: Without dead ends: 547 [2018-11-28 13:17:14,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-11-28 13:17:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 419. [2018-11-28 13:17:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-11-28 13:17:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2018-11-28 13:17:15,007 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 65 [2018-11-28 13:17:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:15,007 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2018-11-28 13:17:15,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2018-11-28 13:17:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 13:17:15,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:15,009 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:15,009 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:15,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1208805305, now seen corresponding path program 1 times [2018-11-28 13:17:15,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:15,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:15,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:15,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:15,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:15,077 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand 4 states. [2018-11-28 13:17:15,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:15,311 INFO L93 Difference]: Finished difference Result 943 states and 1417 transitions. [2018-11-28 13:17:15,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:15,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-28 13:17:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:15,313 INFO L225 Difference]: With dead ends: 943 [2018-11-28 13:17:15,313 INFO L226 Difference]: Without dead ends: 537 [2018-11-28 13:17:15,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:15,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-28 13:17:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 421. [2018-11-28 13:17:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 636 transitions. [2018-11-28 13:17:15,322 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 636 transitions. Word has length 66 [2018-11-28 13:17:15,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:15,323 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 636 transitions. [2018-11-28 13:17:15,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 636 transitions. [2018-11-28 13:17:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:15,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:15,324 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:15,324 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:15,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash -784316286, now seen corresponding path program 1 times [2018-11-28 13:17:15,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:15,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:15,385 INFO L87 Difference]: Start difference. First operand 421 states and 636 transitions. Second operand 4 states. [2018-11-28 13:17:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:15,613 INFO L93 Difference]: Finished difference Result 943 states and 1415 transitions. [2018-11-28 13:17:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:15,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:15,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:15,615 INFO L225 Difference]: With dead ends: 943 [2018-11-28 13:17:15,615 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:17:15,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:17:15,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-28 13:17:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 634 transitions. [2018-11-28 13:17:15,625 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 634 transitions. Word has length 78 [2018-11-28 13:17:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:15,625 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 634 transitions. [2018-11-28 13:17:15,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 634 transitions. [2018-11-28 13:17:15,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:15,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:15,626 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:15,627 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:15,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash -802971744, now seen corresponding path program 1 times [2018-11-28 13:17:15,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:15,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:15,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:15,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:15,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:15,686 INFO L87 Difference]: Start difference. First operand 421 states and 634 transitions. Second operand 4 states. [2018-11-28 13:17:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:15,914 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2018-11-28 13:17:15,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:15,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:15,916 INFO L225 Difference]: With dead ends: 943 [2018-11-28 13:17:15,916 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:17:15,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:17:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-28 13:17:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 632 transitions. [2018-11-28 13:17:15,926 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 632 transitions. Word has length 78 [2018-11-28 13:17:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:15,926 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 632 transitions. [2018-11-28 13:17:15,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 632 transitions. [2018-11-28 13:17:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:15,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:15,927 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:15,927 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:15,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1508472381, now seen corresponding path program 1 times [2018-11-28 13:17:15,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:15,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:15,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:15,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:15,977 INFO L87 Difference]: Start difference. First operand 421 states and 632 transitions. Second operand 4 states. [2018-11-28 13:17:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:16,217 INFO L93 Difference]: Finished difference Result 794 states and 1181 transitions. [2018-11-28 13:17:16,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:16,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:16,219 INFO L225 Difference]: With dead ends: 794 [2018-11-28 13:17:16,219 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:17:16,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:17:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-28 13:17:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 630 transitions. [2018-11-28 13:17:16,231 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 630 transitions. Word has length 78 [2018-11-28 13:17:16,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:16,231 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 630 transitions. [2018-11-28 13:17:16,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 630 transitions. [2018-11-28 13:17:16,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:16,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:16,233 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:16,233 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:16,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:16,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1665283844, now seen corresponding path program 1 times [2018-11-28 13:17:16,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:16,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:16,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:16,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:16,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:16,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:16,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:16,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:16,325 INFO L87 Difference]: Start difference. First operand 421 states and 630 transitions. Second operand 4 states. [2018-11-28 13:17:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:16,544 INFO L93 Difference]: Finished difference Result 871 states and 1296 transitions. [2018-11-28 13:17:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:16,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:16,546 INFO L225 Difference]: With dead ends: 871 [2018-11-28 13:17:16,546 INFO L226 Difference]: Without dead ends: 463 [2018-11-28 13:17:16,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-28 13:17:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-28 13:17:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-11-28 13:17:16,556 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 78 [2018-11-28 13:17:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:16,556 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-11-28 13:17:16,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-11-28 13:17:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:16,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:16,557 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:16,557 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:16,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1646628386, now seen corresponding path program 1 times [2018-11-28 13:17:16,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:16,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:16,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:16,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:16,600 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-11-28 13:17:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:16,755 INFO L93 Difference]: Finished difference Result 871 states and 1292 transitions. [2018-11-28 13:17:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:16,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:16,757 INFO L225 Difference]: With dead ends: 871 [2018-11-28 13:17:16,757 INFO L226 Difference]: Without dead ends: 463 [2018-11-28 13:17:16,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-28 13:17:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-28 13:17:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:16,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 626 transitions. [2018-11-28 13:17:16,766 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 626 transitions. Word has length 78 [2018-11-28 13:17:16,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:16,766 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 626 transitions. [2018-11-28 13:17:16,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 626 transitions. [2018-11-28 13:17:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:17:16,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:16,768 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:16,768 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:16,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:16,768 INFO L82 PathProgramCache]: Analyzing trace with hash 941127749, now seen corresponding path program 1 times [2018-11-28 13:17:16,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:16,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:16,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:16,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:16,806 INFO L87 Difference]: Start difference. First operand 421 states and 626 transitions. Second operand 4 states. [2018-11-28 13:17:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:16,959 INFO L93 Difference]: Finished difference Result 722 states and 1065 transitions. [2018-11-28 13:17:16,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:16,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-28 13:17:16,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:16,961 INFO L225 Difference]: With dead ends: 722 [2018-11-28 13:17:16,961 INFO L226 Difference]: Without dead ends: 463 [2018-11-28 13:17:16,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-28 13:17:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-28 13:17:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 624 transitions. [2018-11-28 13:17:16,970 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 624 transitions. Word has length 78 [2018-11-28 13:17:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:16,970 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 624 transitions. [2018-11-28 13:17:16,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 624 transitions. [2018-11-28 13:17:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:17:16,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:16,971 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:16,971 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:16,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1290131619, now seen corresponding path program 1 times [2018-11-28 13:17:16,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:17,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:17,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:17,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:17,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:17,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:17,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:17,008 INFO L87 Difference]: Start difference. First operand 421 states and 624 transitions. Second operand 4 states. [2018-11-28 13:17:17,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:17,224 INFO L93 Difference]: Finished difference Result 943 states and 1391 transitions. [2018-11-28 13:17:17,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:17,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-28 13:17:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:17,226 INFO L225 Difference]: With dead ends: 943 [2018-11-28 13:17:17,226 INFO L226 Difference]: Without dead ends: 535 [2018-11-28 13:17:17,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-28 13:17:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 421. [2018-11-28 13:17:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2018-11-28 13:17:17,236 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 79 [2018-11-28 13:17:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:17,236 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2018-11-28 13:17:17,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2018-11-28 13:17:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:17:17,237 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:17,238 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:17,238 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:17,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:17,238 INFO L82 PathProgramCache]: Analyzing trace with hash 765876928, now seen corresponding path program 1 times [2018-11-28 13:17:17,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:17,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:17,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:17,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:17,281 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2018-11-28 13:17:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:17,498 INFO L93 Difference]: Finished difference Result 788 states and 1159 transitions. [2018-11-28 13:17:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:17,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-28 13:17:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:17,500 INFO L225 Difference]: With dead ends: 788 [2018-11-28 13:17:17,500 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:17:17,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:17:17,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-11-28 13:17:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 620 transitions. [2018-11-28 13:17:17,511 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 620 transitions. Word has length 79 [2018-11-28 13:17:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:17,511 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 620 transitions. [2018-11-28 13:17:17,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 620 transitions. [2018-11-28 13:17:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:17:17,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:17,513 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:17,513 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:17,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1633028379, now seen corresponding path program 1 times [2018-11-28 13:17:17,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:17,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:17,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:17,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:17,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:17,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:17,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:17,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:17,546 INFO L87 Difference]: Start difference. First operand 421 states and 620 transitions. Second operand 4 states. [2018-11-28 13:17:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:17,702 INFO L93 Difference]: Finished difference Result 871 states and 1276 transitions. [2018-11-28 13:17:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:17,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-28 13:17:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:17,704 INFO L225 Difference]: With dead ends: 871 [2018-11-28 13:17:17,704 INFO L226 Difference]: Without dead ends: 463 [2018-11-28 13:17:17,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-28 13:17:17,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 421. [2018-11-28 13:17:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 618 transitions. [2018-11-28 13:17:17,713 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 618 transitions. Word has length 79 [2018-11-28 13:17:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:17,714 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 618 transitions. [2018-11-28 13:17:17,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 618 transitions. [2018-11-28 13:17:17,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:17:17,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:17,715 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:17,715 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:17,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -605930370, now seen corresponding path program 1 times [2018-11-28 13:17:17,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:17,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:17,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:17,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:17,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:17,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:17,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:17,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:17,753 INFO L87 Difference]: Start difference. First operand 421 states and 618 transitions. Second operand 4 states. [2018-11-28 13:17:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:17,897 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2018-11-28 13:17:17,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:17,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-28 13:17:17,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:17,899 INFO L225 Difference]: With dead ends: 716 [2018-11-28 13:17:17,899 INFO L226 Difference]: Without dead ends: 457 [2018-11-28 13:17:17,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-28 13:17:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-11-28 13:17:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2018-11-28 13:17:17,909 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 79 [2018-11-28 13:17:17,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:17,910 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2018-11-28 13:17:17,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2018-11-28 13:17:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:17:17,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:17,911 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:17,911 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:17,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:17,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1753186171, now seen corresponding path program 1 times [2018-11-28 13:17:17,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:17,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:17,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:17,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:17,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:17,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:17,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:17,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:17,961 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand 4 states. [2018-11-28 13:17:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:18,240 INFO L93 Difference]: Finished difference Result 937 states and 1368 transitions. [2018-11-28 13:17:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:18,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 13:17:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:18,243 INFO L225 Difference]: With dead ends: 937 [2018-11-28 13:17:18,243 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:17:18,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:17:18,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 421. [2018-11-28 13:17:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:18,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 614 transitions. [2018-11-28 13:17:18,259 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 614 transitions. Word has length 80 [2018-11-28 13:17:18,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:18,259 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 614 transitions. [2018-11-28 13:17:18,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:18,259 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 614 transitions. [2018-11-28 13:17:18,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:17:18,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:18,260 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:18,261 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:18,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:18,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1329539449, now seen corresponding path program 1 times [2018-11-28 13:17:18,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:18,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:18,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:18,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:18,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:18,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:18,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:18,329 INFO L87 Difference]: Start difference. First operand 421 states and 614 transitions. Second operand 4 states. [2018-11-28 13:17:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:18,530 INFO L93 Difference]: Finished difference Result 865 states and 1257 transitions. [2018-11-28 13:17:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:18,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-28 13:17:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:18,532 INFO L225 Difference]: With dead ends: 865 [2018-11-28 13:17:18,532 INFO L226 Difference]: Without dead ends: 457 [2018-11-28 13:17:18,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-28 13:17:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-11-28 13:17:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 612 transitions. [2018-11-28 13:17:18,547 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 612 transitions. Word has length 80 [2018-11-28 13:17:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:18,547 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 612 transitions. [2018-11-28 13:17:18,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 612 transitions. [2018-11-28 13:17:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:17:18,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:18,548 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:18,548 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:18,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1468975710, now seen corresponding path program 1 times [2018-11-28 13:17:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:18,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:18,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:18,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:18,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:18,593 INFO L87 Difference]: Start difference. First operand 421 states and 612 transitions. Second operand 4 states. [2018-11-28 13:17:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:18,896 INFO L93 Difference]: Finished difference Result 919 states and 1338 transitions. [2018-11-28 13:17:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:18,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 13:17:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:18,898 INFO L225 Difference]: With dead ends: 919 [2018-11-28 13:17:18,898 INFO L226 Difference]: Without dead ends: 511 [2018-11-28 13:17:18,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-28 13:17:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-11-28 13:17:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 610 transitions. [2018-11-28 13:17:18,913 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 610 transitions. Word has length 81 [2018-11-28 13:17:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:18,913 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 610 transitions. [2018-11-28 13:17:18,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 610 transitions. [2018-11-28 13:17:18,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:17:18,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:18,914 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:18,914 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:18,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1134564595, now seen corresponding path program 1 times [2018-11-28 13:17:18,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:18,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:18,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:18,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:18,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:18,987 INFO L87 Difference]: Start difference. First operand 421 states and 610 transitions. Second operand 4 states. [2018-11-28 13:17:19,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:19,258 INFO L93 Difference]: Finished difference Result 919 states and 1334 transitions. [2018-11-28 13:17:19,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:19,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 13:17:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:19,260 INFO L225 Difference]: With dead ends: 919 [2018-11-28 13:17:19,260 INFO L226 Difference]: Without dead ends: 511 [2018-11-28 13:17:19,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:19,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-11-28 13:17:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 421. [2018-11-28 13:17:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 608 transitions. [2018-11-28 13:17:19,273 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 608 transitions. Word has length 81 [2018-11-28 13:17:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:19,273 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 608 transitions. [2018-11-28 13:17:19,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 608 transitions. [2018-11-28 13:17:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:17:19,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:19,275 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:19,275 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:19,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1220829216, now seen corresponding path program 1 times [2018-11-28 13:17:19,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:19,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:19,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:19,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:19,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:19,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:19,340 INFO L87 Difference]: Start difference. First operand 421 states and 608 transitions. Second operand 4 states. [2018-11-28 13:17:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:19,465 INFO L93 Difference]: Finished difference Result 847 states and 1223 transitions. [2018-11-28 13:17:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:19,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-28 13:17:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:19,467 INFO L225 Difference]: With dead ends: 847 [2018-11-28 13:17:19,467 INFO L226 Difference]: Without dead ends: 439 [2018-11-28 13:17:19,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-11-28 13:17:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 421. [2018-11-28 13:17:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-11-28 13:17:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2018-11-28 13:17:19,480 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 81 [2018-11-28 13:17:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:19,480 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2018-11-28 13:17:19,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2018-11-28 13:17:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:17:19,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:19,481 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:19,482 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:19,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1382711089, now seen corresponding path program 1 times [2018-11-28 13:17:19,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:19,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:17:19,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:19,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:19,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,534 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand 3 states. [2018-11-28 13:17:19,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:19,564 INFO L93 Difference]: Finished difference Result 831 states and 1204 transitions. [2018-11-28 13:17:19,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:19,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-28 13:17:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:19,567 INFO L225 Difference]: With dead ends: 831 [2018-11-28 13:17:19,567 INFO L226 Difference]: Without dead ends: 574 [2018-11-28 13:17:19,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-11-28 13:17:19,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-11-28 13:17:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-28 13:17:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 827 transitions. [2018-11-28 13:17:19,581 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 827 transitions. Word has length 81 [2018-11-28 13:17:19,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:19,581 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 827 transitions. [2018-11-28 13:17:19,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 827 transitions. [2018-11-28 13:17:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:17:19,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:19,583 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:19,583 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:19,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:19,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1024261319, now seen corresponding path program 1 times [2018-11-28 13:17:19,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:19,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:19,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 13:17:19,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:19,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:19,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:19,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:19,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,628 INFO L87 Difference]: Start difference. First operand 574 states and 827 transitions. Second operand 3 states. [2018-11-28 13:17:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:19,658 INFO L93 Difference]: Finished difference Result 729 states and 1052 transitions. [2018-11-28 13:17:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:19,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-28 13:17:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:19,662 INFO L225 Difference]: With dead ends: 729 [2018-11-28 13:17:19,662 INFO L226 Difference]: Without dead ends: 727 [2018-11-28 13:17:19,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-11-28 13:17:19,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2018-11-28 13:17:19,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-28 13:17:19,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1049 transitions. [2018-11-28 13:17:19,680 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1049 transitions. Word has length 83 [2018-11-28 13:17:19,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:19,680 INFO L480 AbstractCegarLoop]: Abstraction has 727 states and 1049 transitions. [2018-11-28 13:17:19,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:19,680 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1049 transitions. [2018-11-28 13:17:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:17:19,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:19,684 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:19,685 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:19,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash 934069236, now seen corresponding path program 1 times [2018-11-28 13:17:19,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:19,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:19,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:19,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,725 INFO L87 Difference]: Start difference. First operand 727 states and 1049 transitions. Second operand 3 states. [2018-11-28 13:17:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:19,769 INFO L93 Difference]: Finished difference Result 1287 states and 1862 transitions. [2018-11-28 13:17:19,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:19,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-28 13:17:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:19,771 INFO L225 Difference]: With dead ends: 1287 [2018-11-28 13:17:19,771 INFO L226 Difference]: Without dead ends: 724 [2018-11-28 13:17:19,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-28 13:17:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-11-28 13:17:19,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-28 13:17:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1039 transitions. [2018-11-28 13:17:19,788 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1039 transitions. Word has length 104 [2018-11-28 13:17:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:19,788 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1039 transitions. [2018-11-28 13:17:19,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1039 transitions. [2018-11-28 13:17:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 13:17:19,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:19,790 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:19,790 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:19,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:19,791 INFO L82 PathProgramCache]: Analyzing trace with hash -148840977, now seen corresponding path program 1 times [2018-11-28 13:17:19,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:19,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:19,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:19,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:19,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:19,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:19,845 INFO L87 Difference]: Start difference. First operand 724 states and 1039 transitions. Second operand 4 states. [2018-11-28 13:17:20,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:20,076 INFO L93 Difference]: Finished difference Result 1692 states and 2439 transitions. [2018-11-28 13:17:20,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:20,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-28 13:17:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:20,079 INFO L225 Difference]: With dead ends: 1692 [2018-11-28 13:17:20,079 INFO L226 Difference]: Without dead ends: 981 [2018-11-28 13:17:20,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-11-28 13:17:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2018-11-28 13:17:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-28 13:17:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1249 transitions. [2018-11-28 13:17:20,093 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1249 transitions. Word has length 106 [2018-11-28 13:17:20,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:20,093 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1249 transitions. [2018-11-28 13:17:20,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1249 transitions. [2018-11-28 13:17:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 13:17:20,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:20,095 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:20,095 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:20,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1084285646, now seen corresponding path program 1 times [2018-11-28 13:17:20,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:20,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:20,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:20,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:20,165 INFO L87 Difference]: Start difference. First operand 844 states and 1249 transitions. Second operand 4 states. [2018-11-28 13:17:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:20,333 INFO L93 Difference]: Finished difference Result 1807 states and 2639 transitions. [2018-11-28 13:17:20,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:20,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-28 13:17:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:20,335 INFO L225 Difference]: With dead ends: 1807 [2018-11-28 13:17:20,335 INFO L226 Difference]: Without dead ends: 976 [2018-11-28 13:17:20,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-11-28 13:17:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-11-28 13:17:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-28 13:17:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1244 transitions. [2018-11-28 13:17:20,358 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1244 transitions. Word has length 121 [2018-11-28 13:17:20,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:20,358 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1244 transitions. [2018-11-28 13:17:20,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1244 transitions. [2018-11-28 13:17:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 13:17:20,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:20,361 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:20,361 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:20,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:20,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1832311600, now seen corresponding path program 1 times [2018-11-28 13:17:20,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:20,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:20,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:20,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:20,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:20,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:20,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:20,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:20,430 INFO L87 Difference]: Start difference. First operand 844 states and 1244 transitions. Second operand 4 states. [2018-11-28 13:17:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:20,601 INFO L93 Difference]: Finished difference Result 1807 states and 2629 transitions. [2018-11-28 13:17:20,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:20,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-28 13:17:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:20,605 INFO L225 Difference]: With dead ends: 1807 [2018-11-28 13:17:20,605 INFO L226 Difference]: Without dead ends: 976 [2018-11-28 13:17:20,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:20,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-11-28 13:17:20,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2018-11-28 13:17:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-11-28 13:17:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1239 transitions. [2018-11-28 13:17:20,619 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1239 transitions. Word has length 121 [2018-11-28 13:17:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:20,620 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 1239 transitions. [2018-11-28 13:17:20,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1239 transitions. [2018-11-28 13:17:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 13:17:20,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:20,622 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:20,622 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:20,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1213590989, now seen corresponding path program 1 times [2018-11-28 13:17:20,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-28 13:17:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:20,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:20,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:20,679 INFO L87 Difference]: Start difference. First operand 844 states and 1239 transitions. Second operand 4 states. [2018-11-28 13:17:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:20,865 INFO L93 Difference]: Finished difference Result 1638 states and 2411 transitions. [2018-11-28 13:17:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:20,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-28 13:17:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:20,867 INFO L225 Difference]: With dead ends: 1638 [2018-11-28 13:17:20,867 INFO L226 Difference]: Without dead ends: 982 [2018-11-28 13:17:20,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-11-28 13:17:20,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2018-11-28 13:17:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-28 13:17:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1359 transitions. [2018-11-28 13:17:20,892 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1359 transitions. Word has length 121 [2018-11-28 13:17:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:20,892 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1359 transitions. [2018-11-28 13:17:20,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1359 transitions. [2018-11-28 13:17:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 13:17:20,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:20,894 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:20,894 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:20,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1233245309, now seen corresponding path program 1 times [2018-11-28 13:17:20,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:20,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:20,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:20,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:20,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:20,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:20,973 INFO L87 Difference]: Start difference. First operand 916 states and 1359 transitions. Second operand 4 states. [2018-11-28 13:17:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:21,127 INFO L93 Difference]: Finished difference Result 1951 states and 2859 transitions. [2018-11-28 13:17:21,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:21,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-28 13:17:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:21,131 INFO L225 Difference]: With dead ends: 1951 [2018-11-28 13:17:21,131 INFO L226 Difference]: Without dead ends: 1048 [2018-11-28 13:17:21,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-28 13:17:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-11-28 13:17:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-28 13:17:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1354 transitions. [2018-11-28 13:17:21,156 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1354 transitions. Word has length 122 [2018-11-28 13:17:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:21,157 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1354 transitions. [2018-11-28 13:17:21,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1354 transitions. [2018-11-28 13:17:21,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-28 13:17:21,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:21,159 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:21,159 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:21,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:21,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2124457781, now seen corresponding path program 1 times [2018-11-28 13:17:21,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:21,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:21,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:21,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:21,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:21,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:21,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:21,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:21,236 INFO L87 Difference]: Start difference. First operand 916 states and 1354 transitions. Second operand 4 states. [2018-11-28 13:17:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:21,478 INFO L93 Difference]: Finished difference Result 1951 states and 2849 transitions. [2018-11-28 13:17:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:21,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-28 13:17:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:21,482 INFO L225 Difference]: With dead ends: 1951 [2018-11-28 13:17:21,483 INFO L226 Difference]: Without dead ends: 1048 [2018-11-28 13:17:21,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-11-28 13:17:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2018-11-28 13:17:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-28 13:17:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1349 transitions. [2018-11-28 13:17:21,508 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1349 transitions. Word has length 123 [2018-11-28 13:17:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:21,508 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1349 transitions. [2018-11-28 13:17:21,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1349 transitions. [2018-11-28 13:17:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-28 13:17:21,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:21,510 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:21,510 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:21,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 805588424, now seen corresponding path program 1 times [2018-11-28 13:17:21,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:21,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:21,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:21,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:21,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:21,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:21,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:21,593 INFO L87 Difference]: Start difference. First operand 916 states and 1349 transitions. Second operand 4 states. [2018-11-28 13:17:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:21,789 INFO L93 Difference]: Finished difference Result 1906 states and 2784 transitions. [2018-11-28 13:17:21,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:21,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-28 13:17:21,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:21,793 INFO L225 Difference]: With dead ends: 1906 [2018-11-28 13:17:21,793 INFO L226 Difference]: Without dead ends: 1003 [2018-11-28 13:17:21,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-28 13:17:21,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2018-11-28 13:17:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-11-28 13:17:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1344 transitions. [2018-11-28 13:17:21,811 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1344 transitions. Word has length 124 [2018-11-28 13:17:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 1344 transitions. [2018-11-28 13:17:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1344 transitions. [2018-11-28 13:17:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-28 13:17:21,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:21,813 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:21,813 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:21,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1158112039, now seen corresponding path program 1 times [2018-11-28 13:17:21,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-28 13:17:21,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:21,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:17:21,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:17:21,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:17:21,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:17:21,866 INFO L87 Difference]: Start difference. First operand 916 states and 1344 transitions. Second operand 4 states. [2018-11-28 13:17:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:22,063 INFO L93 Difference]: Finished difference Result 2051 states and 3014 transitions. [2018-11-28 13:17:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:17:22,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-28 13:17:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:22,066 INFO L225 Difference]: With dead ends: 2051 [2018-11-28 13:17:22,066 INFO L226 Difference]: Without dead ends: 1148 [2018-11-28 13:17:22,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:17:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-28 13:17:22,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2018-11-28 13:17:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2018-11-28 13:17:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1534 transitions. [2018-11-28 13:17:22,083 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1534 transitions. Word has length 124 [2018-11-28 13:17:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:22,083 INFO L480 AbstractCegarLoop]: Abstraction has 1026 states and 1534 transitions. [2018-11-28 13:17:22,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:17:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1534 transitions. [2018-11-28 13:17:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 13:17:22,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:22,085 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:22,085 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:22,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:22,085 INFO L82 PathProgramCache]: Analyzing trace with hash -421436053, now seen corresponding path program 1 times [2018-11-28 13:17:22,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:22,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:22,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:22,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:22,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:22,197 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2018-11-28 13:17:22,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:22,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:17:22,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:17:22,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:17:22,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:17:22,198 INFO L87 Difference]: Start difference. First operand 1026 states and 1534 transitions. Second operand 6 states. [2018-11-28 13:17:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:22,356 INFO L93 Difference]: Finished difference Result 2043 states and 3056 transitions. [2018-11-28 13:17:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:17:22,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-11-28 13:17:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:22,359 INFO L225 Difference]: With dead ends: 2043 [2018-11-28 13:17:22,359 INFO L226 Difference]: Without dead ends: 1030 [2018-11-28 13:17:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:17:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2018-11-28 13:17:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1029. [2018-11-28 13:17:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2018-11-28 13:17:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1537 transitions. [2018-11-28 13:17:22,378 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1537 transitions. Word has length 128 [2018-11-28 13:17:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 1029 states and 1537 transitions. [2018-11-28 13:17:22,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:17:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1537 transitions. [2018-11-28 13:17:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-28 13:17:22,380 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:22,380 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:22,380 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:22,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-11-28 13:17:22,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:17:22,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:17:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:22,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:17:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:17:22,598 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:17:22,640 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:17:22,641 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:17:22,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:17:22 BoogieIcfgContainer [2018-11-28 13:17:22,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:17:22,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:17:22,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:17:22,694 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:17:22,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:12" (3/4) ... [2018-11-28 13:17:22,698 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:17:22,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:17:22,698 INFO L168 Benchmark]: Toolchain (without parser) took 11236.11 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.6 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:22,700 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:22,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:22,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:22,701 INFO L168 Benchmark]: Boogie Preprocessor took 61.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:22,702 INFO L168 Benchmark]: RCFGBuilder took 811.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.0 MB). Peak memory consumption was 78.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:22,702 INFO L168 Benchmark]: TraceAbstraction took 9896.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -89.6 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:17:22,702 INFO L168 Benchmark]: Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:17:22,704 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.7 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 811.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 78.0 MB). Peak memory consumption was 78.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9896.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -89.6 MB). Peak memory consumption was 160.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.73 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20488 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20485 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1645]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1330. Possible FailurePath: [L1039] static int init = 1; [L1040] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20542, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20490:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={20498:0}, SSLv3_client_data={20490:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->info_callback={6:-5}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=12292, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->version=1, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->init_buf={3:-2}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=12292, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=0, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->bbio={0:0}, s->wbio={0:1}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4368, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=1, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND TRUE s->state == 4384 [L1310] ret = __VERIFIER_nondet_int() [L1311] COND TRUE blastFlag == 1 [L1312] blastFlag = 2 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->hit=0, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4384, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={6:-5}, ((s->s3)->tmp.new_cipher)->algorithms=20524, (s->s3)->tmp.new_cipher={20541:0}, blastFlag=2, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=10, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1330] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 2 [L1335] blastFlag = 3 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4400, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=3, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1166] COND TRUE s->state == 4416 [L1350] ret = __VERIFIER_nondet_int() [L1351] COND TRUE blastFlag == 3 [L1352] blastFlag = 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4416, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=11, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND TRUE s->state == 4432 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND FALSE !(blastFlag == 5) VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={6:-5}, (s->s3)->tmp.reuse_message=20535, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->s3={20502:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1633] skip = 0 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4432, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=1, s={20498:0}, s={20498:0}, s->state=4448, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1178] COND TRUE s->state == 4448 [L1389] ret = __VERIFIER_nondet_int() [L1390] COND TRUE blastFlag == 4 VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={6:-5}, blastFlag=4, buf={20507:20513}, init=1, malloc(sizeof(int))={20530:0}, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20490:0}, state=4448, tmp=0, tmp___0={20530:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 9.8s OverallTime, 35 OverallIterations, 7 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7566 SDtfs, 2657 SDslu, 9982 SDs, 0 SdLazy, 5228 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 68 SyntacticMatches, 45 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1029occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 3084 NumberOfCodeBlocks, 3084 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2907 ConstructedInterpolants, 0 QuantifiedInterpolants, 612042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2666/2666 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:17:24,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:17:24,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:17:24,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:17:24,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:17:24,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:17:24,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:17:24,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:17:24,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:17:24,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:17:24,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:17:24,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:17:24,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:17:24,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:17:24,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:17:24,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:17:24,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:17:24,226 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:17:24,227 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:17:24,228 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:17:24,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:17:24,230 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:17:24,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:17:24,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:17:24,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:17:24,233 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:17:24,234 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:17:24,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:17:24,235 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:17:24,236 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:17:24,236 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:17:24,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:17:24,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:17:24,237 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:17:24,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:17:24,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:17:24,239 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 13:17:24,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:17:24,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:17:24,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:17:24,250 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:17:24,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:17:24,251 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:17:24,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:17:24,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:17:24,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:24,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:17:24,253 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 13:17:24,253 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_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdf0cf9bd7de1f69825d4535f203da45c4edbbfc [2018-11-28 13:17:24,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:17:24,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:17:24,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:17:24,288 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:17:24,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:17:24,289 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/../../sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-28 13:17:24,325 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/7024c4417/367cf42e55354282b55d3abc800731f4/FLAGd0b1c40b6 [2018-11-28 13:17:24,791 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:17:24,791 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/sv-benchmarks/c/loops/s3_false-unreach-call.i [2018-11-28 13:17:24,802 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/7024c4417/367cf42e55354282b55d3abc800731f4/FLAGd0b1c40b6 [2018-11-28 13:17:25,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/data/7024c4417/367cf42e55354282b55d3abc800731f4 [2018-11-28 13:17:25,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:17:25,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:17:25,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:25,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:17:25,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:17:25,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb9df94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25, skipping insertion in model container [2018-11-28 13:17:25,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:17:25,356 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:17:25,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:25,718 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:17:25,798 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:17:25,815 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:17:25,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25 WrapperNode [2018-11-28 13:17:25,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:17:25,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:25,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:17:25,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:17:25,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:17:25,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:17:25,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:17:25,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:17:25,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... [2018-11-28 13:17:25,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:17:25,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:17:25,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:17:25,913 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:17:25,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:17:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:17:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:17:25,957 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:17:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:17:25,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-28 13:17:25,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-28 13:17:25,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:17:25,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:17:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 13:17:26,184 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:17:26,185 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:17:27,517 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:17:27,517 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 13:17:27,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:27 BoogieIcfgContainer [2018-11-28 13:17:27,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:17:27,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:17:27,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:17:27,520 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:17:27,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:17:25" (1/3) ... [2018-11-28 13:17:27,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f18973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:27, skipping insertion in model container [2018-11-28 13:17:27,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:17:25" (2/3) ... [2018-11-28 13:17:27,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f18973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:17:27, skipping insertion in model container [2018-11-28 13:17:27,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:27" (3/3) ... [2018-11-28 13:17:27,523 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_false-unreach-call.i [2018-11-28 13:17:27,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:17:27,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:17:27,546 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:17:27,565 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:17:27,566 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:17:27,566 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:17:27,566 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:17:27,566 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:17:27,567 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:17:27,567 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:17:27,567 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:17:27,567 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:17:27,579 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2018-11-28 13:17:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 13:17:27,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:27,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:27,586 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:27,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:27,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1513562951, now seen corresponding path program 1 times [2018-11-28 13:17:27,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:27,593 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:27,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:27,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:27,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:27,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:27,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:27,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:27,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:27,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:27,797 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2018-11-28 13:17:27,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:27,882 INFO L93 Difference]: Finished difference Result 385 states and 637 transitions. [2018-11-28 13:17:27,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:27,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 13:17:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:27,894 INFO L225 Difference]: With dead ends: 385 [2018-11-28 13:17:27,894 INFO L226 Difference]: Without dead ends: 223 [2018-11-28 13:17:27,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-28 13:17:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-28 13:17:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-28 13:17:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2018-11-28 13:17:27,942 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 30 [2018-11-28 13:17:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:27,943 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2018-11-28 13:17:27,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2018-11-28 13:17:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 13:17:27,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:27,944 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:27,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:27,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:27,945 INFO L82 PathProgramCache]: Analyzing trace with hash -959560751, now seen corresponding path program 1 times [2018-11-28 13:17:27,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:27,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:27,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:28,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:17:28,071 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:28,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:28,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:28,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,075 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand 3 states. [2018-11-28 13:17:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:28,188 INFO L93 Difference]: Finished difference Result 432 states and 642 transitions. [2018-11-28 13:17:28,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:28,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-28 13:17:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:28,191 INFO L225 Difference]: With dead ends: 432 [2018-11-28 13:17:28,191 INFO L226 Difference]: Without dead ends: 325 [2018-11-28 13:17:28,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-28 13:17:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-11-28 13:17:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-11-28 13:17:28,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 476 transitions. [2018-11-28 13:17:28,212 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 476 transitions. Word has length 45 [2018-11-28 13:17:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:28,212 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 476 transitions. [2018-11-28 13:17:28,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 476 transitions. [2018-11-28 13:17:28,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:17:28,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:28,215 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:28,215 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:28,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1822634295, now seen corresponding path program 1 times [2018-11-28 13:17:28,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:28,217 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:28,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:28,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 13:17:28,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:28,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:28,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:28,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:28,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,371 INFO L87 Difference]: Start difference. First operand 325 states and 476 transitions. Second operand 3 states. [2018-11-28 13:17:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:28,449 INFO L93 Difference]: Finished difference Result 638 states and 943 transitions. [2018-11-28 13:17:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:28,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 13:17:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:28,451 INFO L225 Difference]: With dead ends: 638 [2018-11-28 13:17:28,451 INFO L226 Difference]: Without dead ends: 429 [2018-11-28 13:17:28,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-11-28 13:17:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-11-28 13:17:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-28 13:17:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 628 transitions. [2018-11-28 13:17:28,469 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 628 transitions. Word has length 63 [2018-11-28 13:17:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:28,470 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 628 transitions. [2018-11-28 13:17:28,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 628 transitions. [2018-11-28 13:17:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-28 13:17:28,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:28,473 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:28,474 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:28,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1221318135, now seen corresponding path program 1 times [2018-11-28 13:17:28,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:28,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:28,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 13:17:28,645 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:28,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:28,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:28,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,649 INFO L87 Difference]: Start difference. First operand 429 states and 628 transitions. Second operand 3 states. [2018-11-28 13:17:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:28,738 INFO L93 Difference]: Finished difference Result 845 states and 1246 transitions. [2018-11-28 13:17:28,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:28,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-28 13:17:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:28,741 INFO L225 Difference]: With dead ends: 845 [2018-11-28 13:17:28,741 INFO L226 Difference]: Without dead ends: 532 [2018-11-28 13:17:28,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-11-28 13:17:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-11-28 13:17:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-28 13:17:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 779 transitions. [2018-11-28 13:17:28,761 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 779 transitions. Word has length 83 [2018-11-28 13:17:28,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:28,761 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 779 transitions. [2018-11-28 13:17:28,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 779 transitions. [2018-11-28 13:17:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:17:28,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:28,764 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:28,764 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:28,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1674718222, now seen corresponding path program 1 times [2018-11-28 13:17:28,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:28,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:28,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-28 13:17:28,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:28,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:28,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:17:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:17:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:17:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:28,996 INFO L87 Difference]: Start difference. First operand 532 states and 779 transitions. Second operand 3 states. [2018-11-28 13:17:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:29,129 INFO L93 Difference]: Finished difference Result 945 states and 1387 transitions. [2018-11-28 13:17:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:17:29,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-28 13:17:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:29,132 INFO L225 Difference]: With dead ends: 945 [2018-11-28 13:17:29,132 INFO L226 Difference]: Without dead ends: 529 [2018-11-28 13:17:29,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:17:29,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-11-28 13:17:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2018-11-28 13:17:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-11-28 13:17:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 769 transitions. [2018-11-28 13:17:29,163 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 769 transitions. Word has length 104 [2018-11-28 13:17:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:29,164 INFO L480 AbstractCegarLoop]: Abstraction has 529 states and 769 transitions. [2018-11-28 13:17:29,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:17:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 769 transitions. [2018-11-28 13:17:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 13:17:29,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:29,166 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:29,168 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:29,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:29,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1067312749, now seen corresponding path program 1 times [2018-11-28 13:17:29,169 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:29,169 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:29,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:29,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:29,934 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 13:17:29,972 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-28 13:17:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:17:29,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:29,989 INFO L478 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 18 treesize of output 27 [2018-11-28 13:17:29,990 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:29,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,029 INFO L478 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 30 treesize of output 31 [2018-11-28 13:17:30,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:30,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-28 13:17:30,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-28 13:17:30,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,095 INFO L478 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 32 treesize of output 38 [2018-11-28 13:17:30,096 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,122 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-28 13:17:30,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,179 INFO L478 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 23 treesize of output 56 [2018-11-28 13:17:30,180 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,196 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,205 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:30,225 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:45, output treesize:20 [2018-11-28 13:17:30,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,293 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2018-11-28 13:17:30,302 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,315 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-28 13:17:30,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-11-28 13:17:30,387 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:30,407 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2018-11-28 13:17:30,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-28 13:17:30,436 INFO L478 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 8 [2018-11-28 13:17:30,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:30,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:17:30,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:30,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-11-28 13:17:30,462 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-28 13:17:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:17:30,477 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:30,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:30,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:17:30,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:17:30,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:17:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:17:30,482 INFO L87 Difference]: Start difference. First operand 529 states and 769 transitions. Second operand 6 states. [2018-11-28 13:17:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:34,537 INFO L93 Difference]: Finished difference Result 1028 states and 1496 transitions. [2018-11-28 13:17:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:17:34,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2018-11-28 13:17:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:34,541 INFO L225 Difference]: With dead ends: 1028 [2018-11-28 13:17:34,541 INFO L226 Difference]: Without dead ends: 613 [2018-11-28 13:17:34,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:17:34,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-28 13:17:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 537. [2018-11-28 13:17:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-28 13:17:34,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 782 transitions. [2018-11-28 13:17:34,559 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 782 transitions. Word has length 106 [2018-11-28 13:17:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:34,559 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 782 transitions. [2018-11-28 13:17:34,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:17:34,560 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 782 transitions. [2018-11-28 13:17:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-28 13:17:34,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:34,561 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:34,561 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:34,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash 534436016, now seen corresponding path program 1 times [2018-11-28 13:17:34,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:34,562 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:35,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:35,426 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 13:17:35,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-28 13:17:35,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-11-28 13:17:35,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,454 INFO L478 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 32 treesize of output 38 [2018-11-28 13:17:35,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-28 13:17:35,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,510 INFO L478 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 23 treesize of output 56 [2018-11-28 13:17:35,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,522 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,550 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-11-28 13:17:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:17:35,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,563 INFO L478 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 18 treesize of output 27 [2018-11-28 13:17:35,563 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,591 INFO L478 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 30 treesize of output 31 [2018-11-28 13:17:35,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:17:35,594 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,603 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,613 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:17:35,637 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-11-28 13:17:35,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,725 INFO L478 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 62 [2018-11-28 13:17:35,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,737 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2018-11-28 13:17:35,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,794 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-11-28 13:17:35,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 13:17:35,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:22 [2018-11-28 13:17:35,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-11-28 13:17:35,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:35,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:17:35,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:35,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-11-28 13:17:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:17:35,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:35,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:35,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:17:35,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:17:35,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:17:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:17:35,945 INFO L87 Difference]: Start difference. First operand 537 states and 782 transitions. Second operand 6 states. [2018-11-28 13:17:39,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:39,843 INFO L93 Difference]: Finished difference Result 1025 states and 1492 transitions. [2018-11-28 13:17:39,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:17:39,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-11-28 13:17:39,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:39,846 INFO L225 Difference]: With dead ends: 1025 [2018-11-28 13:17:39,846 INFO L226 Difference]: Without dead ends: 610 [2018-11-28 13:17:39,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:17:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-11-28 13:17:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 538. [2018-11-28 13:17:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-11-28 13:17:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 783 transitions. [2018-11-28 13:17:39,859 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 783 transitions. Word has length 107 [2018-11-28 13:17:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:39,859 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 783 transitions. [2018-11-28 13:17:39,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:17:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 783 transitions. [2018-11-28 13:17:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-28 13:17:39,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:39,860 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:39,860 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:39,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash -48734010, now seen corresponding path program 1 times [2018-11-28 13:17:39,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:39,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:39,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:40,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:40,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:17:40,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:17:40,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:17:40,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,618 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:17:40,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:17:40,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:40,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:17:40,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:40,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:17:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:17:40,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:40,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:40,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:17:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:17:40,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:17:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:17:40,680 INFO L87 Difference]: Start difference. First operand 538 states and 783 transitions. Second operand 7 states. [2018-11-28 13:17:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:48,374 INFO L93 Difference]: Finished difference Result 1420 states and 2074 transitions. [2018-11-28 13:17:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:17:48,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-28 13:17:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:48,379 INFO L225 Difference]: With dead ends: 1420 [2018-11-28 13:17:48,379 INFO L226 Difference]: Without dead ends: 904 [2018-11-28 13:17:48,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:17:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2018-11-28 13:17:48,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 642. [2018-11-28 13:17:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-28 13:17:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 967 transitions. [2018-11-28 13:17:48,406 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 967 transitions. Word has length 121 [2018-11-28 13:17:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:48,406 INFO L480 AbstractCegarLoop]: Abstraction has 642 states and 967 transitions. [2018-11-28 13:17:48,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:17:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 967 transitions. [2018-11-28 13:17:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 13:17:48,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:48,408 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:17:48,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:48,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1515231419, now seen corresponding path program 1 times [2018-11-28 13:17:48,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:48,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:48,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:17:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:17:49,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:49,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:17:49,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:17:49,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:49,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:49,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:17:49,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,209 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:17:49,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:17:49,253 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:49,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:17:49,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:49,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:17:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:17:49,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:49,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:17:49,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:17:49,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:17:49,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:17:49,288 INFO L87 Difference]: Start difference. First operand 642 states and 967 transitions. Second operand 7 states. [2018-11-28 13:17:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:17:55,581 INFO L93 Difference]: Finished difference Result 1508 states and 2236 transitions. [2018-11-28 13:17:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:17:55,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-28 13:17:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:17:55,586 INFO L225 Difference]: With dead ends: 1508 [2018-11-28 13:17:55,586 INFO L226 Difference]: Without dead ends: 888 [2018-11-28 13:17:55,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:17:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-11-28 13:17:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 646. [2018-11-28 13:17:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-28 13:17:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 971 transitions. [2018-11-28 13:17:55,613 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 971 transitions. Word has length 122 [2018-11-28 13:17:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:17:55,613 INFO L480 AbstractCegarLoop]: Abstraction has 646 states and 971 transitions. [2018-11-28 13:17:55,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:17:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 971 transitions. [2018-11-28 13:17:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 13:17:55,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:17:55,614 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2018-11-28 13:17:55,615 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:17:55,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:17:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1330335365, now seen corresponding path program 2 times [2018-11-28 13:17:55,615 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:17:55,615 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:17:55,630 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:17:56,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:17:56,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:17:56,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:17:56,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:17:56,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 13:17:56,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 13:17:56,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 13:17:56,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:56,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:56,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:17:56,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 13:17:56,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:17:56,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:17:56,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:17:56,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:17:56,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:17:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 13:17:56,255 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:17:56,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:17:56,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:17:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:17:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:17:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:17:56,260 INFO L87 Difference]: Start difference. First operand 646 states and 971 transitions. Second operand 8 states. [2018-11-28 13:18:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:04,517 INFO L93 Difference]: Finished difference Result 1644 states and 2459 transitions. [2018-11-28 13:18:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:18:04,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2018-11-28 13:18:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:04,521 INFO L225 Difference]: With dead ends: 1644 [2018-11-28 13:18:04,521 INFO L226 Difference]: Without dead ends: 1020 [2018-11-28 13:18:04,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:18:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2018-11-28 13:18:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 730. [2018-11-28 13:18:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-28 13:18:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1111 transitions. [2018-11-28 13:18:04,545 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1111 transitions. Word has length 136 [2018-11-28 13:18:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:04,545 INFO L480 AbstractCegarLoop]: Abstraction has 730 states and 1111 transitions. [2018-11-28 13:18:04,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:18:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1111 transitions. [2018-11-28 13:18:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 13:18:04,547 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:04,547 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 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] [2018-11-28 13:18:04,547 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:04,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 236422585, now seen corresponding path program 1 times [2018-11-28 13:18:04,548 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:04,548 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:04,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:18:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:05,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:05,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:05,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:05,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:05,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:05,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:05,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:05,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:05,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:05,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:05,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 96 proven. 5 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:05,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:05,484 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:05,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:05,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:18:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:05,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:05,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:05,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:05,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:05,504 INFO L87 Difference]: Start difference. First operand 730 states and 1111 transitions. Second operand 9 states. [2018-11-28 13:18:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:14,079 INFO L93 Difference]: Finished difference Result 2126 states and 3179 transitions. [2018-11-28 13:18:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:14,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-28 13:18:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:14,084 INFO L225 Difference]: With dead ends: 2126 [2018-11-28 13:18:14,084 INFO L226 Difference]: Without dead ends: 1418 [2018-11-28 13:18:14,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:14,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-11-28 13:18:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 785. [2018-11-28 13:18:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-11-28 13:18:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1183 transitions. [2018-11-28 13:18:14,108 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1183 transitions. Word has length 136 [2018-11-28 13:18:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:14,108 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 1183 transitions. [2018-11-28 13:18:14,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1183 transitions. [2018-11-28 13:18:14,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 13:18:14,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:14,110 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 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] [2018-11-28 13:18:14,110 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:14,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash -511603369, now seen corresponding path program 1 times [2018-11-28 13:18:14,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:14,111 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:14,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:14,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:15,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:15,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:15,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:15,010 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:15,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:15,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,026 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:15,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:15,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:15,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:15,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:15,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:15,086 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:15,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:15,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:18:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:15,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:15,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:15,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:15,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:15,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:15,101 INFO L87 Difference]: Start difference. First operand 785 states and 1183 transitions. Second operand 9 states. [2018-11-28 13:18:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:23,510 INFO L93 Difference]: Finished difference Result 2182 states and 3239 transitions. [2018-11-28 13:18:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:23,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-28 13:18:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:23,515 INFO L225 Difference]: With dead ends: 2182 [2018-11-28 13:18:23,515 INFO L226 Difference]: Without dead ends: 1419 [2018-11-28 13:18:23,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:23,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-11-28 13:18:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 790. [2018-11-28 13:18:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-11-28 13:18:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1179 transitions. [2018-11-28 13:18:23,555 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1179 transitions. Word has length 136 [2018-11-28 13:18:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:23,555 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1179 transitions. [2018-11-28 13:18:23,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1179 transitions. [2018-11-28 13:18:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-28 13:18:23,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:23,557 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:23,557 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:23,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash 107117242, now seen corresponding path program 1 times [2018-11-28 13:18:23,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:23,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:24,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:24,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:24,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:24,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:24,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:24,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:24,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,375 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:24,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:24,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:24,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:24,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:24,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:24,433 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:24,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:24,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-28 13:18:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:24,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:24,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:24,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:24,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:24,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:24,446 INFO L87 Difference]: Start difference. First operand 790 states and 1179 transitions. Second operand 9 states. [2018-11-28 13:18:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:31,374 INFO L93 Difference]: Finished difference Result 2086 states and 3064 transitions. [2018-11-28 13:18:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:31,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-28 13:18:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:31,378 INFO L225 Difference]: With dead ends: 2086 [2018-11-28 13:18:31,378 INFO L226 Difference]: Without dead ends: 1479 [2018-11-28 13:18:31,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2018-11-28 13:18:31,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 870. [2018-11-28 13:18:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-28 13:18:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1291 transitions. [2018-11-28 13:18:31,405 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1291 transitions. Word has length 136 [2018-11-28 13:18:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:31,405 INFO L480 AbstractCegarLoop]: Abstraction has 870 states and 1291 transitions. [2018-11-28 13:18:31,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1291 transitions. [2018-11-28 13:18:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-28 13:18:31,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:31,407 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 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] [2018-11-28 13:18:31,407 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:31,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1054004188, now seen corresponding path program 1 times [2018-11-28 13:18:31,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:31,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:32,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:32,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:32,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:32,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:32,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:32,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:32,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,307 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:32,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:32,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:32,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:32,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:32,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:32,371 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:32,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:32,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:18:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:32,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:32,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:32,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:32,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:32,383 INFO L87 Difference]: Start difference. First operand 870 states and 1291 transitions. Second operand 9 states. [2018-11-28 13:18:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:42,184 INFO L93 Difference]: Finished difference Result 2347 states and 3446 transitions. [2018-11-28 13:18:42,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:42,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-28 13:18:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:42,188 INFO L225 Difference]: With dead ends: 2347 [2018-11-28 13:18:42,188 INFO L226 Difference]: Without dead ends: 1499 [2018-11-28 13:18:42,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2018-11-28 13:18:42,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 875. [2018-11-28 13:18:42,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-11-28 13:18:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1282 transitions. [2018-11-28 13:18:42,236 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1282 transitions. Word has length 137 [2018-11-28 13:18:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:42,237 INFO L480 AbstractCegarLoop]: Abstraction has 875 states and 1282 transitions. [2018-11-28 13:18:42,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1282 transitions. [2018-11-28 13:18:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-28 13:18:42,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:42,239 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:18:42,239 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:42,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1193261695, now seen corresponding path program 1 times [2018-11-28 13:18:42,239 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:42,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:43,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:43,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:43,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:43,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:43,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:43,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:43,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,065 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:43,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:43,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:43,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:43,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 122 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:43,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:43,119 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:43,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:43,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:18:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:43,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:43,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:43,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:43,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:43,132 INFO L87 Difference]: Start difference. First operand 875 states and 1282 transitions. Second operand 9 states. [2018-11-28 13:18:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:50,552 INFO L93 Difference]: Finished difference Result 2134 states and 3101 transitions. [2018-11-28 13:18:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:50,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-28 13:18:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:50,556 INFO L225 Difference]: With dead ends: 2134 [2018-11-28 13:18:50,556 INFO L226 Difference]: Without dead ends: 1459 [2018-11-28 13:18:50,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2018-11-28 13:18:50,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 874. [2018-11-28 13:18:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-28 13:18:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1271 transitions. [2018-11-28 13:18:50,591 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1271 transitions. Word has length 137 [2018-11-28 13:18:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:50,591 INFO L480 AbstractCegarLoop]: Abstraction has 874 states and 1271 transitions. [2018-11-28 13:18:50,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1271 transitions. [2018-11-28 13:18:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-28 13:18:50,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:50,592 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 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] [2018-11-28 13:18:50,593 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:50,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 14748156, now seen corresponding path program 1 times [2018-11-28 13:18:50,593 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:50,593 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:51,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:51,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:51,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:51,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:51,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:51,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:51,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,436 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:51,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:51,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:51,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:51,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:51,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:51,507 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:51,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:51,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-28 13:18:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:51,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:51,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:51,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:51,521 INFO L87 Difference]: Start difference. First operand 874 states and 1271 transitions. Second operand 9 states. [2018-11-28 13:18:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:18:58,651 INFO L93 Difference]: Finished difference Result 2345 states and 3394 transitions. [2018-11-28 13:18:58,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:18:58,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-28 13:18:58,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:18:58,655 INFO L225 Difference]: With dead ends: 2345 [2018-11-28 13:18:58,655 INFO L226 Difference]: Without dead ends: 1487 [2018-11-28 13:18:58,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:18:58,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2018-11-28 13:18:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 879. [2018-11-28 13:18:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-28 13:18:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1263 transitions. [2018-11-28 13:18:58,701 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1263 transitions. Word has length 138 [2018-11-28 13:18:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:18:58,701 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1263 transitions. [2018-11-28 13:18:58,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:18:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1263 transitions. [2018-11-28 13:18:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 13:18:58,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:18:58,702 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 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] [2018-11-28 13:18:58,702 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:18:58,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:18:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash -170900511, now seen corresponding path program 1 times [2018-11-28 13:18:58,703 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:18:58,703 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:18:58,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:18:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:18:59,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:18:59,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:18:59,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:18:59,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:59,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:59,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:18:59,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:18:59,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:18:59,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:18:59,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:18:59,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:18:59,527 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:59,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:18:59,553 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:18:59,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:18:59,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-28 13:18:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:18:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:18:59,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:18:59,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:18:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:18:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:18:59,568 INFO L87 Difference]: Start difference. First operand 879 states and 1263 transitions. Second operand 9 states. [2018-11-28 13:19:05,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:05,341 INFO L93 Difference]: Finished difference Result 2314 states and 3324 transitions. [2018-11-28 13:19:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:05,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-28 13:19:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:05,345 INFO L225 Difference]: With dead ends: 2314 [2018-11-28 13:19:05,345 INFO L226 Difference]: Without dead ends: 1451 [2018-11-28 13:19:05,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:19:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2018-11-28 13:19:05,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 884. [2018-11-28 13:19:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2018-11-28 13:19:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1255 transitions. [2018-11-28 13:19:05,380 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1255 transitions. Word has length 139 [2018-11-28 13:19:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:05,380 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1255 transitions. [2018-11-28 13:19:05,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:19:05,380 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1255 transitions. [2018-11-28 13:19:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 13:19:05,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:05,381 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:05,381 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:05,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:05,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1475321086, now seen corresponding path program 1 times [2018-11-28 13:19:05,382 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:05,382 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:06,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:06,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 13:19:06,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:19:06,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-28 13:19:06,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 13:19:06,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,190 INFO L478 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 25 treesize of output 68 [2018-11-28 13:19:06,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-28 13:19:06,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,242 INFO L478 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 46 treesize of output 51 [2018-11-28 13:19:06,245 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:19:06,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,251 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 88 [2018-11-28 13:19:06,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-28 13:19:06,294 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2018-11-28 13:19:06,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,338 INFO L478 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 46 treesize of output 51 [2018-11-28 13:19:06,341 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:19:06,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,350 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 88 [2018-11-28 13:19:06,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 62 [2018-11-28 13:19:06,393 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,414 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2018-11-28 13:19:06,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-28 13:19:06,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:06,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 8 [2018-11-28 13:19:06,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:3 [2018-11-28 13:19:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 42 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:19:06,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:19:06,547 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:19:06,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:06,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-11-28 13:19:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-28 13:19:06,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:19:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 13 [2018-11-28 13:19:06,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:19:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:19:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:19:06,566 INFO L87 Difference]: Start difference. First operand 884 states and 1255 transitions. Second operand 13 states. [2018-11-28 13:19:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:27,708 INFO L93 Difference]: Finished difference Result 3327 states and 4752 transitions. [2018-11-28 13:19:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:19:27,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 139 [2018-11-28 13:19:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:27,712 INFO L225 Difference]: With dead ends: 3327 [2018-11-28 13:19:27,712 INFO L226 Difference]: Without dead ends: 2459 [2018-11-28 13:19:27,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:19:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-11-28 13:19:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 1480. [2018-11-28 13:19:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-11-28 13:19:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2136 transitions. [2018-11-28 13:19:27,772 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2136 transitions. Word has length 139 [2018-11-28 13:19:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:27,772 INFO L480 AbstractCegarLoop]: Abstraction has 1480 states and 2136 transitions. [2018-11-28 13:19:27,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:19:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2136 transitions. [2018-11-28 13:19:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 13:19:27,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:27,774 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2018-11-28 13:19:27,774 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:27,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:27,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1537360700, now seen corresponding path program 1 times [2018-11-28 13:19:27,774 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:27,774 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:27,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:28,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:28,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:19:28,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:19:28,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:28,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:28,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:19:28,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,535 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:19:28,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:19:28,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:28,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:19:28,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:19:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 127 proven. 3 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:28,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:19:28,587 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:19:28,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:28,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:19:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:28,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:19:28,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:19:28,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:19:28,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:19:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:28,601 INFO L87 Difference]: Start difference. First operand 1480 states and 2136 transitions. Second operand 9 states. [2018-11-28 13:19:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:35,170 INFO L93 Difference]: Finished difference Result 4104 states and 5909 transitions. [2018-11-28 13:19:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:35,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-28 13:19:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:35,176 INFO L225 Difference]: With dead ends: 4104 [2018-11-28 13:19:35,176 INFO L226 Difference]: Without dead ends: 2640 [2018-11-28 13:19:35,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:19:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2640 states. [2018-11-28 13:19:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2640 to 1636. [2018-11-28 13:19:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2018-11-28 13:19:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2330 transitions. [2018-11-28 13:19:35,243 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2330 transitions. Word has length 139 [2018-11-28 13:19:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:35,244 INFO L480 AbstractCegarLoop]: Abstraction has 1636 states and 2330 transitions. [2018-11-28 13:19:35,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:19:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2330 transitions. [2018-11-28 13:19:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 13:19:35,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:35,246 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:35,246 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:35,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2134600974, now seen corresponding path program 1 times [2018-11-28 13:19:35,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:35,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:35,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:35,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:35,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:19:36,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:19:36,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:36,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:36,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:19:36,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:19:36,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:19:36,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:36,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:19:36,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19: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-11-28 13:19:36,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:19:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:36,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:19:36,080 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:19:36,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:36,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:19:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:36,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:19:36,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:19:36,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:19:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:19:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:36,095 INFO L87 Difference]: Start difference. First operand 1636 states and 2330 transitions. Second operand 9 states. [2018-11-28 13:19:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:42,587 INFO L93 Difference]: Finished difference Result 4340 states and 6189 transitions. [2018-11-28 13:19:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:42,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-11-28 13:19:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:42,593 INFO L225 Difference]: With dead ends: 4340 [2018-11-28 13:19:42,593 INFO L226 Difference]: Without dead ends: 2720 [2018-11-28 13:19:42,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:19:42,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-11-28 13:19:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 1656. [2018-11-28 13:19:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2018-11-28 13:19:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2356 transitions. [2018-11-28 13:19:42,663 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2356 transitions. Word has length 139 [2018-11-28 13:19:42,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:42,663 INFO L480 AbstractCegarLoop]: Abstraction has 1656 states and 2356 transitions. [2018-11-28 13:19:42,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:19:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2356 transitions. [2018-11-28 13:19:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-28 13:19:42,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:42,665 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:42,665 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:42,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:42,665 INFO L82 PathProgramCache]: Analyzing trace with hash 913596365, now seen corresponding path program 1 times [2018-11-28 13:19:42,666 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:42,666 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:42,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:43,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:43,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:19:43,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:19:43,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:43,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:43,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:19:43,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,433 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:19:43,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:19:43,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:43,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:19:43,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:19:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 135 proven. 1 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:43,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:19:43,491 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:19:43,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:43,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:19:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:19:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:19:43,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:19:43,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:19:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:43,516 INFO L87 Difference]: Start difference. First operand 1656 states and 2356 transitions. Second operand 9 states. [2018-11-28 13:19:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:49,775 INFO L93 Difference]: Finished difference Result 4217 states and 6024 transitions. [2018-11-28 13:19:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:49,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-28 13:19:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:49,781 INFO L225 Difference]: With dead ends: 4217 [2018-11-28 13:19:49,781 INFO L226 Difference]: Without dead ends: 2577 [2018-11-28 13:19:49,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:19:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2018-11-28 13:19:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 1674. [2018-11-28 13:19:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-11-28 13:19:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2374 transitions. [2018-11-28 13:19:49,856 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2374 transitions. Word has length 140 [2018-11-28 13:19:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:49,856 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 2374 transitions. [2018-11-28 13:19:49,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:19:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2374 transitions. [2018-11-28 13:19:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-28 13:19:49,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:49,857 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:49,858 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:49,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1901235017, now seen corresponding path program 1 times [2018-11-28 13:19:49,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:49,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:19:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:19:50,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:19:50,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 13:19:50,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:19:50,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:50,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:50,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-28 13:19:50,575 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,593 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2018-11-28 13:19:50,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 13:19:50,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:19:50,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-28 13:19:50,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-28 13:19:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:50,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:19:50,665 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-28 13:19:50,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:19:50,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-28 13:19:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-11-28 13:19:50,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:19:50,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-28 13:19:50,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:19:50,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:19:50,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:19:50,680 INFO L87 Difference]: Start difference. First operand 1674 states and 2374 transitions. Second operand 9 states. [2018-11-28 13:19:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:19:58,320 INFO L93 Difference]: Finished difference Result 4199 states and 5984 transitions. [2018-11-28 13:19:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:19:58,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 140 [2018-11-28 13:19:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:19:58,327 INFO L225 Difference]: With dead ends: 4199 [2018-11-28 13:19:58,327 INFO L226 Difference]: Without dead ends: 2541 [2018-11-28 13:19:58,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:19:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2018-11-28 13:19:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1674. [2018-11-28 13:19:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1674 states. [2018-11-28 13:19:58,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2352 transitions. [2018-11-28 13:19:58,406 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2352 transitions. Word has length 140 [2018-11-28 13:19:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:19:58,406 INFO L480 AbstractCegarLoop]: Abstraction has 1674 states and 2352 transitions. [2018-11-28 13:19:58,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:19:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2352 transitions. [2018-11-28 13:19:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-28 13:19:58,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:19:58,408 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:19:58,408 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:19:58,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:19:58,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1528997636, now seen corresponding path program 1 times [2018-11-28 13:19:58,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:19:58,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:19:58,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:20:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:20:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:20:04,417 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:20:04,462 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:20:04,463 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:20:04,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:20:04 BoogieIcfgContainer [2018-11-28 13:20:04,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:20:04,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:20:04,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:20:04,516 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:20:04,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:17:27" (3/4) ... [2018-11-28 13:20:04,518 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:20:04,536 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:20:04,537 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-11-28 13:20:04,600 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5a9df952-a31f-4239-993b-28236e42a5bf/bin-2019/uautomizer/witness.graphml [2018-11-28 13:20:04,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:20:04,601 INFO L168 Benchmark]: Toolchain (without parser) took 159290.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 938.0 MB in the beginning and 908.5 MB in the end (delta: 29.5 MB). Peak memory consumption was 306.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,601 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:04,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:20:04,602 INFO L168 Benchmark]: Boogie Preprocessor took 63.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,602 INFO L168 Benchmark]: RCFGBuilder took 1604.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 76.8 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,604 INFO L168 Benchmark]: TraceAbstraction took 156997.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.1 GB in the beginning and 934.5 MB in the end (delta: 116.3 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,605 INFO L168 Benchmark]: Witness Printer took 83.96 ms. Allocated memory is still 1.3 GB. Free memory was 934.5 MB in the beginning and 908.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:20:04,606 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 504.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1604.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 76.8 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 156997.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 115.9 MB). Free memory was 1.1 GB in the beginning and 934.5 MB in the end (delta: 116.3 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. * Witness Printer took 83.96 ms. Allocated memory is still 1.3 GB. Free memory was 934.5 MB in the beginning and 908.5 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * 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; [L1040] 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={5:0}] [L1062] SSL *s ; [L1066] s = malloc (sizeof (SSL)) [L1067] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1068] s->ctx = malloc(sizeof(SSL_CTX)) [L1069] s->state = 12292 [L1070] s->version = __VERIFIER_nondet_int() [L1071] CALL ssl3_connect(s) VAL [init=1, s={67108872:0}, SSLv3_client_data={5:0}] [L1077] BUF_MEM *buf = __VERIFIER_nondet_pointer(); [L1078] unsigned long tmp ; [L1079] unsigned long l ; [L1080] long num1 ; [L1081] void (*cb)() ; [L1082] int ret ; [L1083] int new_state ; [L1084] int state ; [L1085] int skip ; [L1086] int *tmp___0 ; [L1087] int tmp___1 = __VERIFIER_nondet_int(); [L1088] int tmp___2 = __VERIFIER_nondet_int(); [L1089] int tmp___3 ; [L1090] int tmp___4 ; [L1091] int tmp___5 ; [L1092] int tmp___6 ; [L1093] int tmp___7 ; [L1094] int tmp___8 ; [L1095] long tmp___9 ; [L1097] int blastFlag ; [L1100] blastFlag = 0 [L1101] s->state = 12292 [L1102] s->hit = __VERIFIER_nondet_int() [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] tmp___0 = (int*)malloc(sizeof(int)) [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->info_callback={0:1}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=12292, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1249] EXPR s->version VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->version=768, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->init_buf={0:1}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1268] tmp___4 = __VERIFIER_nondet_int() [L1269] COND FALSE !(! tmp___4) [L1275] tmp___5 = __VERIFIER_nondet_int() [L1276] COND FALSE !(! tmp___5) [L1282] s->state = 4368 [L1283] EXPR s->ctx [L1283] EXPR (s->ctx)->stats.sess_connect [L1283] (s->ctx)->stats.sess_connect += 1 [L1284] s->init_num = 0 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=12292, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=0, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=4294967295, s={67108872:0}, s={67108872:0}, s->state=4368, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND TRUE s->state == 4368 [L1288] s->shutdown = 0 [L1289] ret = __VERIFIER_nondet_int() [L1290] COND TRUE blastFlag == 0 [L1291] blastFlag = 1 VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1295] COND FALSE !(ret <= 0) [L1300] s->state = 4384 [L1301] s->init_num = 0 [L1302] EXPR s->bbio [L1302] EXPR s->wbio VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->bbio={1:0}, s->wbio={0:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1302] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4368, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=1, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4384, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1316] COND FALSE !(ret <= 0) [L1321] s->hit VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->hit=0, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1321] COND FALSE !(s->hit) [L1324] s->state = 4400 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1326] s->init_num = 0 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4384, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4400, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND TRUE s->state == 4400 [L1330] EXPR s->s3 [L1330] EXPR (s->s3)->tmp.new_cipher [L1330] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:1}, ((s->s3)->tmp.new_cipher)->algorithms=0, (s->s3)->tmp.new_cipher={67108872:52}, blastFlag=2, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1339] COND FALSE !(ret <= 0) VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1345] s->state = 4416 [L1346] s->init_num = 0 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4400, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=3, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4416, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1] [L1356] COND FALSE !(ret <= 0) [L1361] s->state = 4432 [L1362] s->init_num = 0 [L1363] tmp___6 = __VERIFIER_nondet_int() [L1364] COND FALSE !(! tmp___6) VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4416, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4432, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4448 [L1385] s->init_num = 0 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.reuse_message VAL [={0:1}, (s->s3)->tmp.reuse_message=1, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->s3={100663305:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1130] COND TRUE 1 VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4432, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1172] COND FALSE !(s->state == 4432) [L1175] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1175] COND FALSE !(s->state == 4433) [L1178] EXPR s->state VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=1073741824, s={67108872:0}, s={67108872:0}, s->state=4448, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306: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 [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=0, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] [L1645] __VERIFIER_error() VAL [={0:1}, blastFlag=4, buf={0:0}, init=1, malloc(sizeof(int))={-100663306:0}, ret=0, s={67108872:0}, s={67108872:0}, skip=0, SSLv3_client_data={5:0}, state=4448, tmp=0, tmp___0={-100663306:0}, tmp___1=0, tmp___2=0, tmp___4=1, tmp___5=1, tmp___6=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 1 error locations. UNSAFE Result, 156.9s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 132.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4261 SDtfs, 10410 SDslu, 11387 SDs, 0 SdLazy, 12050 SolverSat, 1447 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 122.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4325 GetRequests, 4123 SyntacticMatches, 5 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1674occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 10014 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 14.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2716 NumberOfCodeBlocks, 2716 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4195 ConstructedInterpolants, 21 QuantifiedInterpolants, 1946391 SizeOfPredicates, 124 NumberOfNonLiveVariables, 8263 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 34 InterpolantComputations, 21 PerfectInterpolantSequences, 5842/5921 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...