./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 ............................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 23:03:41,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:03:41,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:03:41,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:03:41,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:03:41,793 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:03:41,794 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:03:41,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:03:41,795 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:03:41,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:03:41,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:03:41,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:03:41,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:03:41,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:03:41,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:03:41,798 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:03:41,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:03:41,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:03:41,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:03:41,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:03:41,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:03:41,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:03:41,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:03:41,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:03:41,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:03:41,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:03:41,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:03:41,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:03:41,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:03:41,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:03:41,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:03:41,806 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:03:41,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:03:41,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:03:41,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:03:41,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:03:41,807 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 23:03:41,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:03:41,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:03:41,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 23:03:41,815 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 23:03:41,815 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 23:03:41,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:03:41,816 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:03:41,817 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:03:41,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:03:41,818 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 23:03:41,818 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 [2018-12-08 23:03:41,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:03:41,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:03:41,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:03:41,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:03:41,845 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:03:41,845 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2018-12-08 23:03:41,879 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/3155fd2a3/96ea2c21a49640f4bc82b70db4d3f800/FLAG16c32a489 [2018-12-08 23:03:42,302 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:03:42,303 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2018-12-08 23:03:42,312 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/3155fd2a3/96ea2c21a49640f4bc82b70db4d3f800/FLAG16c32a489 [2018-12-08 23:03:42,320 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/3155fd2a3/96ea2c21a49640f4bc82b70db4d3f800 [2018-12-08 23:03:42,322 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:03:42,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:03:42,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:03:42,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:03:42,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:03:42,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56aae676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42, skipping insertion in model container [2018-12-08 23:03:42,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:03:42,358 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:03:42,595 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:03:42,604 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:03:42,657 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:03:42,668 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:03:42,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42 WrapperNode [2018-12-08 23:03:42,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:03:42,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:03:42,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:03:42,669 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:03:42,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:03:42,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:03:42,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:03:42,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:03:42,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... [2018-12-08 23:03:42,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:03:42,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:03:42,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:03:42,738 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:03:42,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 23:03:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 23:03:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 23:03:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 23:03:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 23:03:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 23:03:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-08 23:03:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-08 23:03:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:03:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:03:42,945 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 23:03:42,945 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 23:03:43,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:03:43,310 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 23:03:43,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:03:43 BoogieIcfgContainer [2018-12-08 23:03:43,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:03:43,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 23:03:43,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 23:03:43,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 23:03:43,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:03:42" (1/3) ... [2018-12-08 23:03:43,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f844d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:03:43, skipping insertion in model container [2018-12-08 23:03:43,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:42" (2/3) ... [2018-12-08 23:03:43,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f844d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:03:43, skipping insertion in model container [2018-12-08 23:03:43,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:03:43" (3/3) ... [2018-12-08 23:03:43,315 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.04_false-unreach-call.i.cil.c [2018-12-08 23:03:43,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 23:03:43,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 23:03:43,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 23:03:43,352 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 23:03:43,352 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 23:03:43,353 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 23:03:43,353 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 23:03:43,353 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 23:03:43,353 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 23:03:43,353 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 23:03:43,353 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 23:03:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2018-12-08 23:03:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 23:03:43,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:43,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:43,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 500880985, now seen corresponding path program 1 times [2018-12-08 23:03:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:43,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:03:43,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:43,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:03:43,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:43,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:03:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:03:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:43,564 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2018-12-08 23:03:43,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:43,624 INFO L93 Difference]: Finished difference Result 379 states and 634 transitions. [2018-12-08 23:03:43,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:03:43,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-08 23:03:43,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:43,632 INFO L225 Difference]: With dead ends: 379 [2018-12-08 23:03:43,633 INFO L226 Difference]: Without dead ends: 219 [2018-12-08 23:03:43,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-08 23:03:43,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-08 23:03:43,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-08 23:03:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2018-12-08 23:03:43,669 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2018-12-08 23:03:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:43,670 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2018-12-08 23:03:43,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:03:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2018-12-08 23:03:43,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 23:03:43,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:43,671 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:43,671 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1966298573, now seen corresponding path program 1 times [2018-12-08 23:03:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:03:43,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:43,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:03:43,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:43,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:03:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:03:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:43,721 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2018-12-08 23:03:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:43,759 INFO L93 Difference]: Finished difference Result 424 states and 634 transitions. [2018-12-08 23:03:43,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:03:43,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-08 23:03:43,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:43,761 INFO L225 Difference]: With dead ends: 424 [2018-12-08 23:03:43,761 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 23:03:43,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 23:03:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-12-08 23:03:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-08 23:03:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2018-12-08 23:03:43,773 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 45 [2018-12-08 23:03:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:43,773 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2018-12-08 23:03:43,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:03:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2018-12-08 23:03:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 23:03:43,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:43,775 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:43,775 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:43,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 207210029, now seen corresponding path program 1 times [2018-12-08 23:03:43,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:43,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:43,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:43,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:43,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:43,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:43,848 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand 4 states. [2018-12-08 23:03:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:44,165 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2018-12-08 23:03:44,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:44,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 23:03:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:44,167 INFO L225 Difference]: With dead ends: 811 [2018-12-08 23:03:44,167 INFO L226 Difference]: Without dead ends: 505 [2018-12-08 23:03:44,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-12-08 23:03:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 369. [2018-12-08 23:03:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 23:03:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2018-12-08 23:03:44,185 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 63 [2018-12-08 23:03:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:44,186 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2018-12-08 23:03:44,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:44,186 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2018-12-08 23:03:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 23:03:44,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:44,188 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:44,189 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 73196523, now seen corresponding path program 1 times [2018-12-08 23:03:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:44,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:44,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:44,264 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:44,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:44,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:44,265 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand 4 states. [2018-12-08 23:03:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:44,445 INFO L93 Difference]: Finished difference Result 811 states and 1223 transitions. [2018-12-08 23:03:44,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:44,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-08 23:03:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:44,446 INFO L225 Difference]: With dead ends: 811 [2018-12-08 23:03:44,447 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:44,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 409. [2018-12-08 23:03:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-08 23:03:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 624 transitions. [2018-12-08 23:03:44,459 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 624 transitions. Word has length 63 [2018-12-08 23:03:44,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:44,459 INFO L480 AbstractCegarLoop]: Abstraction has 409 states and 624 transitions. [2018-12-08 23:03:44,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:44,459 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 624 transitions. [2018-12-08 23:03:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 23:03:44,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:44,461 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:44,461 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:44,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:44,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2123857804, now seen corresponding path program 1 times [2018-12-08 23:03:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:44,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:44,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:44,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:44,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:44,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:44,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:44,531 INFO L87 Difference]: Start difference. First operand 409 states and 624 transitions. Second operand 4 states. [2018-12-08 23:03:44,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:44,780 INFO L93 Difference]: Finished difference Result 933 states and 1414 transitions. [2018-12-08 23:03:44,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:44,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 23:03:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:44,782 INFO L225 Difference]: With dead ends: 933 [2018-12-08 23:03:44,782 INFO L226 Difference]: Without dead ends: 537 [2018-12-08 23:03:44,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:44,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-08 23:03:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 411. [2018-12-08 23:03:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 626 transitions. [2018-12-08 23:03:44,791 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 626 transitions. Word has length 64 [2018-12-08 23:03:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:44,792 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 626 transitions. [2018-12-08 23:03:44,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:44,792 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 626 transitions. [2018-12-08 23:03:44,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:03:44,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:44,793 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] [2018-12-08 23:03:44,793 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:44,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:44,793 INFO L82 PathProgramCache]: Analyzing trace with hash -138627003, now seen corresponding path program 1 times [2018-12-08 23:03:44,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:44,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:44,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:44,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:44,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:44,855 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:44,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:44,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:44,856 INFO L87 Difference]: Start difference. First operand 411 states and 626 transitions. Second operand 4 states. [2018-12-08 23:03:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:45,119 INFO L93 Difference]: Finished difference Result 933 states and 1412 transitions. [2018-12-08 23:03:45,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:45,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 23:03:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:45,121 INFO L225 Difference]: With dead ends: 933 [2018-12-08 23:03:45,122 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 23:03:45,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:45,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 23:03:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 23:03:45,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 624 transitions. [2018-12-08 23:03:45,134 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 624 transitions. Word has length 77 [2018-12-08 23:03:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 624 transitions. [2018-12-08 23:03:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 624 transitions. [2018-12-08 23:03:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:03:45,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:45,135 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] [2018-12-08 23:03:45,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:45,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1247607449, now seen corresponding path program 1 times [2018-12-08 23:03:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:45,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:45,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:45,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:45,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:45,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:45,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:45,192 INFO L87 Difference]: Start difference. First operand 411 states and 624 transitions. Second operand 4 states. [2018-12-08 23:03:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:45,445 INFO L93 Difference]: Finished difference Result 933 states and 1408 transitions. [2018-12-08 23:03:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:45,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 23:03:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:45,447 INFO L225 Difference]: With dead ends: 933 [2018-12-08 23:03:45,448 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 23:03:45,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 23:03:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 23:03:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 622 transitions. [2018-12-08 23:03:45,460 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 622 transitions. Word has length 77 [2018-12-08 23:03:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:45,460 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 622 transitions. [2018-12-08 23:03:45,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 622 transitions. [2018-12-08 23:03:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:03:45,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:45,461 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] [2018-12-08 23:03:45,462 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:45,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:45,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1167986301, now seen corresponding path program 1 times [2018-12-08 23:03:45,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:45,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:45,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:45,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:45,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:45,521 INFO L87 Difference]: Start difference. First operand 411 states and 622 transitions. Second operand 4 states. [2018-12-08 23:03:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:45,687 INFO L93 Difference]: Finished difference Result 853 states and 1283 transitions. [2018-12-08 23:03:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:45,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 23:03:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:45,689 INFO L225 Difference]: With dead ends: 853 [2018-12-08 23:03:45,689 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:45,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:45,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 23:03:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 620 transitions. [2018-12-08 23:03:45,696 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 620 transitions. Word has length 77 [2018-12-08 23:03:45,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:45,696 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 620 transitions. [2018-12-08 23:03:45,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 620 transitions. [2018-12-08 23:03:45,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 23:03:45,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:45,697 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:45,697 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:45,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:45,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2018000549, now seen corresponding path program 1 times [2018-12-08 23:03:45,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:45,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:45,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:45,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:45,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:45,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:45,732 INFO L87 Difference]: Start difference. First operand 411 states and 620 transitions. Second operand 4 states. [2018-12-08 23:03:45,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:45,893 INFO L93 Difference]: Finished difference Result 853 states and 1279 transitions. [2018-12-08 23:03:45,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:45,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-12-08 23:03:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:45,896 INFO L225 Difference]: With dead ends: 853 [2018-12-08 23:03:45,896 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:45,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 23:03:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2018-12-08 23:03:45,908 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 77 [2018-12-08 23:03:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:45,908 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2018-12-08 23:03:45,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2018-12-08 23:03:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 23:03:45,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:45,909 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] [2018-12-08 23:03:45,910 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:45,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash 33267782, now seen corresponding path program 1 times [2018-12-08 23:03:45,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:45,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:45,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:45,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:45,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:45,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:45,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:45,953 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand 4 states. [2018-12-08 23:03:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:46,201 INFO L93 Difference]: Finished difference Result 933 states and 1396 transitions. [2018-12-08 23:03:46,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:46,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 23:03:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:46,203 INFO L225 Difference]: With dead ends: 933 [2018-12-08 23:03:46,203 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 23:03:46,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 23:03:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 23:03:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 616 transitions. [2018-12-08 23:03:46,215 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 616 transitions. Word has length 78 [2018-12-08 23:03:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:46,216 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 616 transitions. [2018-12-08 23:03:46,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 616 transitions. [2018-12-08 23:03:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 23:03:46,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:46,217 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:46,217 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:46,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:46,217 INFO L82 PathProgramCache]: Analyzing trace with hash 333328865, now seen corresponding path program 1 times [2018-12-08 23:03:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:46,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:46,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:46,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:46,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:46,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:46,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:46,270 INFO L87 Difference]: Start difference. First operand 411 states and 616 transitions. Second operand 4 states. [2018-12-08 23:03:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:46,494 INFO L93 Difference]: Finished difference Result 788 states and 1173 transitions. [2018-12-08 23:03:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:46,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 23:03:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:46,495 INFO L225 Difference]: With dead ends: 788 [2018-12-08 23:03:46,495 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 23:03:46,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 23:03:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 23:03:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 614 transitions. [2018-12-08 23:03:46,502 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 614 transitions. Word has length 78 [2018-12-08 23:03:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:46,503 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 614 transitions. [2018-12-08 23:03:46,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 614 transitions. [2018-12-08 23:03:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 23:03:46,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:46,503 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] [2018-12-08 23:03:46,504 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:46,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1812099384, now seen corresponding path program 1 times [2018-12-08 23:03:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:46,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:46,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:46,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:46,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:46,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:46,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:46,539 INFO L87 Difference]: Start difference. First operand 411 states and 614 transitions. Second operand 4 states. [2018-12-08 23:03:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:46,710 INFO L93 Difference]: Finished difference Result 853 states and 1267 transitions. [2018-12-08 23:03:46,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:46,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 23:03:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:46,711 INFO L225 Difference]: With dead ends: 853 [2018-12-08 23:03:46,711 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:46,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 23:03:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 612 transitions. [2018-12-08 23:03:46,718 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 612 transitions. Word has length 78 [2018-12-08 23:03:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:46,718 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 612 transitions. [2018-12-08 23:03:46,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 612 transitions. [2018-12-08 23:03:46,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 23:03:46,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:46,719 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:46,719 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:46,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:46,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1512038301, now seen corresponding path program 1 times [2018-12-08 23:03:46,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:46,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:46,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:46,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:46,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:46,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:46,769 INFO L87 Difference]: Start difference. First operand 411 states and 612 transitions. Second operand 4 states. [2018-12-08 23:03:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:46,946 INFO L93 Difference]: Finished difference Result 708 states and 1046 transitions. [2018-12-08 23:03:46,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:46,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-08 23:03:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:46,947 INFO L225 Difference]: With dead ends: 708 [2018-12-08 23:03:46,947 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:46,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 23:03:46,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 610 transitions. [2018-12-08 23:03:46,954 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 610 transitions. Word has length 78 [2018-12-08 23:03:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:46,954 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 610 transitions. [2018-12-08 23:03:46,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 610 transitions. [2018-12-08 23:03:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 23:03:46,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:46,955 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] [2018-12-08 23:03:46,956 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:46,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:46,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1142274914, now seen corresponding path program 1 times [2018-12-08 23:03:46,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:46,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:46,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:46,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:46,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:46,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:46,987 INFO L87 Difference]: Start difference. First operand 411 states and 610 transitions. Second operand 4 states. [2018-12-08 23:03:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:47,221 INFO L93 Difference]: Finished difference Result 933 states and 1380 transitions. [2018-12-08 23:03:47,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:47,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 23:03:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:47,222 INFO L225 Difference]: With dead ends: 933 [2018-12-08 23:03:47,222 INFO L226 Difference]: Without dead ends: 535 [2018-12-08 23:03:47,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-12-08 23:03:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 411. [2018-12-08 23:03:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 608 transitions. [2018-12-08 23:03:47,234 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 608 transitions. Word has length 79 [2018-12-08 23:03:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:47,234 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 608 transitions. [2018-12-08 23:03:47,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 608 transitions. [2018-12-08 23:03:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 23:03:47,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:47,236 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:47,236 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:47,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -147702750, now seen corresponding path program 1 times [2018-12-08 23:03:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:47,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:47,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:47,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:47,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:47,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:47,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:47,284 INFO L87 Difference]: Start difference. First operand 411 states and 608 transitions. Second operand 4 states. [2018-12-08 23:03:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:47,507 INFO L93 Difference]: Finished difference Result 782 states and 1154 transitions. [2018-12-08 23:03:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:47,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 23:03:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:47,509 INFO L225 Difference]: With dead ends: 782 [2018-12-08 23:03:47,509 INFO L226 Difference]: Without dead ends: 529 [2018-12-08 23:03:47,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-12-08 23:03:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2018-12-08 23:03:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 606 transitions. [2018-12-08 23:03:47,520 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 606 transitions. Word has length 79 [2018-12-08 23:03:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:47,520 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 606 transitions. [2018-12-08 23:03:47,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 606 transitions. [2018-12-08 23:03:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 23:03:47,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:47,522 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] [2018-12-08 23:03:47,522 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:47,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:47,522 INFO L82 PathProgramCache]: Analyzing trace with hash -229532384, now seen corresponding path program 1 times [2018-12-08 23:03:47,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:47,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:47,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:47,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:47,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:47,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:47,561 INFO L87 Difference]: Start difference. First operand 411 states and 606 transitions. Second operand 4 states. [2018-12-08 23:03:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:47,737 INFO L93 Difference]: Finished difference Result 853 states and 1251 transitions. [2018-12-08 23:03:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:47,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 23:03:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:47,738 INFO L225 Difference]: With dead ends: 853 [2018-12-08 23:03:47,739 INFO L226 Difference]: Without dead ends: 455 [2018-12-08 23:03:47,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-08 23:03:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 411. [2018-12-08 23:03:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 604 transitions. [2018-12-08 23:03:47,749 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 604 transitions. Word has length 79 [2018-12-08 23:03:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:47,749 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 604 transitions. [2018-12-08 23:03:47,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 604 transitions. [2018-12-08 23:03:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 23:03:47,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:47,751 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:47,751 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:47,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:47,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1519510048, now seen corresponding path program 1 times [2018-12-08 23:03:47,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:47,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:47,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:47,791 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:47,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:47,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:47,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:47,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:47,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:47,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:47,792 INFO L87 Difference]: Start difference. First operand 411 states and 604 transitions. Second operand 4 states. [2018-12-08 23:03:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:47,951 INFO L93 Difference]: Finished difference Result 702 states and 1027 transitions. [2018-12-08 23:03:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:47,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-08 23:03:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:47,953 INFO L225 Difference]: With dead ends: 702 [2018-12-08 23:03:47,953 INFO L226 Difference]: Without dead ends: 449 [2018-12-08 23:03:47,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-12-08 23:03:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 411. [2018-12-08 23:03:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 602 transitions. [2018-12-08 23:03:47,959 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 602 transitions. Word has length 79 [2018-12-08 23:03:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 602 transitions. [2018-12-08 23:03:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 602 transitions. [2018-12-08 23:03:47,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 23:03:47,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:47,960 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] [2018-12-08 23:03:47,960 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:47,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1218338273, now seen corresponding path program 1 times [2018-12-08 23:03:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:47,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:48,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:48,003 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:48,004 INFO L87 Difference]: Start difference. First operand 411 states and 602 transitions. Second operand 4 states. [2018-12-08 23:03:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:48,205 INFO L93 Difference]: Finished difference Result 909 states and 1335 transitions. [2018-12-08 23:03:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:48,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 23:03:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:48,206 INFO L225 Difference]: With dead ends: 909 [2018-12-08 23:03:48,206 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 23:03:48,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 23:03:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2018-12-08 23:03:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 600 transitions. [2018-12-08 23:03:48,214 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 600 transitions. Word has length 80 [2018-12-08 23:03:48,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:48,214 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 600 transitions. [2018-12-08 23:03:48,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 600 transitions. [2018-12-08 23:03:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 23:03:48,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:48,215 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] [2018-12-08 23:03:48,215 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:48,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1641984995, now seen corresponding path program 1 times [2018-12-08 23:03:48,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:48,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:48,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:48,249 INFO L87 Difference]: Start difference. First operand 411 states and 600 transitions. Second operand 4 states. [2018-12-08 23:03:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:48,395 INFO L93 Difference]: Finished difference Result 829 states and 1210 transitions. [2018-12-08 23:03:48,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:48,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-08 23:03:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:48,397 INFO L225 Difference]: With dead ends: 829 [2018-12-08 23:03:48,397 INFO L226 Difference]: Without dead ends: 431 [2018-12-08 23:03:48,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-08 23:03:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2018-12-08 23:03:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2018-12-08 23:03:48,408 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 80 [2018-12-08 23:03:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:48,408 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2018-12-08 23:03:48,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2018-12-08 23:03:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 23:03:48,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:48,409 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:48,409 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:48,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash 287084446, now seen corresponding path program 1 times [2018-12-08 23:03:48,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 23:03:48,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 23:03:48,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 23:03:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 23:03:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 23:03:48,443 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand 4 states. [2018-12-08 23:03:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:48,630 INFO L93 Difference]: Finished difference Result 909 states and 1327 transitions. [2018-12-08 23:03:48,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 23:03:48,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-08 23:03:48,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:48,631 INFO L225 Difference]: With dead ends: 909 [2018-12-08 23:03:48,632 INFO L226 Difference]: Without dead ends: 511 [2018-12-08 23:03:48,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:03:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-12-08 23:03:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 411. [2018-12-08 23:03:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 23:03:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 596 transitions. [2018-12-08 23:03:48,643 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 596 transitions. Word has length 81 [2018-12-08 23:03:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:48,643 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 596 transitions. [2018-12-08 23:03:48,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 23:03:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 596 transitions. [2018-12-08 23:03:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-08 23:03:48,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:48,644 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:48,644 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:48,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash 535230940, now seen corresponding path program 1 times [2018-12-08 23:03:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,682 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 23:03:48,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:03:48,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:03:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:03:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:48,683 INFO L87 Difference]: Start difference. First operand 411 states and 596 transitions. Second operand 3 states. [2018-12-08 23:03:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:48,708 INFO L93 Difference]: Finished difference Result 811 states and 1184 transitions. [2018-12-08 23:03:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:03:48,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-08 23:03:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:48,709 INFO L225 Difference]: With dead ends: 811 [2018-12-08 23:03:48,710 INFO L226 Difference]: Without dead ends: 560 [2018-12-08 23:03:48,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-12-08 23:03:48,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2018-12-08 23:03:48,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-12-08 23:03:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 813 transitions. [2018-12-08 23:03:48,718 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 813 transitions. Word has length 81 [2018-12-08 23:03:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:48,718 INFO L480 AbstractCegarLoop]: Abstraction has 560 states and 813 transitions. [2018-12-08 23:03:48,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:03:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 813 transitions. [2018-12-08 23:03:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 23:03:48,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:48,719 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:48,719 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:48,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:48,719 INFO L82 PathProgramCache]: Analyzing trace with hash -608380723, now seen corresponding path program 1 times [2018-12-08 23:03:48,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 23:03:48,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:03:48,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:03:48,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:03:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:48,747 INFO L87 Difference]: Start difference. First operand 560 states and 813 transitions. Second operand 3 states. [2018-12-08 23:03:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:48,781 INFO L93 Difference]: Finished difference Result 1109 states and 1618 transitions. [2018-12-08 23:03:48,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:03:48,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-12-08 23:03:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:48,783 INFO L225 Difference]: With dead ends: 1109 [2018-12-08 23:03:48,784 INFO L226 Difference]: Without dead ends: 709 [2018-12-08 23:03:48,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:03:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-12-08 23:03:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 709. [2018-12-08 23:03:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2018-12-08 23:03:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1031 transitions. [2018-12-08 23:03:48,800 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1031 transitions. Word has length 83 [2018-12-08 23:03:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:48,800 INFO L480 AbstractCegarLoop]: Abstraction has 709 states and 1031 transitions. [2018-12-08 23:03:48,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:03:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1031 transitions. [2018-12-08 23:03:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 23:03:48,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:48,801 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:03:48,801 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:48,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1632820368, now seen corresponding path program 1 times [2018-12-08 23:03:48,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:48,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:48,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:48,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 23:03:48,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:48,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:03:48,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:48,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:03:48,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:03:48,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:03:48,902 INFO L87 Difference]: Start difference. First operand 709 states and 1031 transitions. Second operand 6 states. [2018-12-08 23:03:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:49,211 INFO L93 Difference]: Finished difference Result 1343 states and 1958 transitions. [2018-12-08 23:03:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:03:49,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 23:03:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:49,213 INFO L225 Difference]: With dead ends: 1343 [2018-12-08 23:03:49,213 INFO L226 Difference]: Without dead ends: 792 [2018-12-08 23:03:49,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:03:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-12-08 23:03:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 717. [2018-12-08 23:03:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-12-08 23:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1044 transitions. [2018-12-08 23:03:49,223 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1044 transitions. Word has length 104 [2018-12-08 23:03:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:49,223 INFO L480 AbstractCegarLoop]: Abstraction has 717 states and 1044 transitions. [2018-12-08 23:03:49,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:03:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1044 transitions. [2018-12-08 23:03:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 23:03:49,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:49,224 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] [2018-12-08 23:03:49,224 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:49,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 496357303, now seen corresponding path program 1 times [2018-12-08 23:03:49,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:49,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:03:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 23:03:49,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:03:49,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 23:03:49,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:03:49,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 23:03:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 23:03:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 23:03:49,297 INFO L87 Difference]: Start difference. First operand 717 states and 1044 transitions. Second operand 6 states. [2018-12-08 23:03:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:03:49,572 INFO L93 Difference]: Finished difference Result 1340 states and 1954 transitions. [2018-12-08 23:03:49,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:03:49,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-12-08 23:03:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:03:49,574 INFO L225 Difference]: With dead ends: 1340 [2018-12-08 23:03:49,574 INFO L226 Difference]: Without dead ends: 789 [2018-12-08 23:03:49,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:03:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-12-08 23:03:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 718. [2018-12-08 23:03:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-12-08 23:03:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1045 transitions. [2018-12-08 23:03:49,587 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1045 transitions. Word has length 105 [2018-12-08 23:03:49,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:03:49,587 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 1045 transitions. [2018-12-08 23:03:49,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 23:03:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1045 transitions. [2018-12-08 23:03:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 23:03:49,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:03:49,589 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] [2018-12-08 23:03:49,589 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:03:49,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:03:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1670912648, now seen corresponding path program 1 times [2018-12-08 23:03:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:03:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:49,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:03:49,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:03:49,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:03:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:03:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 23:03:49,787 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 23:03:49,817 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20486 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 23:03:49,817 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-08 23:03:49,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 11:03:49 BoogieIcfgContainer [2018-12-08 23:03:49,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 23:03:49,847 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 23:03:49,847 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 23:03:49,847 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 23:03:49,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:03:43" (3/4) ... [2018-12-08 23:03:49,849 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 23:03:49,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 23:03:49,850 INFO L168 Benchmark]: Toolchain (without parser) took 7527.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 951.7 MB in the beginning and 986.7 MB in the end (delta: -35.0 MB). Peak memory consumption was 179.4 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:49,851 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:03:49,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:49,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:03:49,851 INFO L168 Benchmark]: Boogie Preprocessor took 45.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:49,852 INFO L168 Benchmark]: RCFGBuilder took 572.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:49,852 INFO L168 Benchmark]: TraceAbstraction took 6535.74 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.3 MB). Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:49,852 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory is still 986.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:03:49,854 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 572.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6535.74 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.3 MB). Free memory was 1.0 GB in the beginning and 986.7 MB in the end (delta: 14.2 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory is still 986.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20486 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 20490 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1643]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1334. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=20533, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={20492:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1074] CALL ssl3_connect(s) VAL [init=1, s={20498:0}, SSLv3_client_data={20492:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int *tmp___0 = __VERIFIER_nondet_pointer() ; [L1090] int tmp___1 = __VERIFIER_nondet_int() ; [L1091] int tmp___2 = __VERIFIER_nondet_int() ; [L1092] int tmp___3 = __VERIFIER_nondet_int() ; [L1093] int tmp___4 = __VERIFIER_nondet_int() ; [L1094] int tmp___5 = __VERIFIER_nondet_int() ; [L1095] int tmp___6 = __VERIFIER_nondet_int() ; [L1096] int tmp___7 = __VERIFIER_nondet_int() ; [L1097] int tmp___8 = __VERIFIER_nondet_int() ; [L1098] long tmp___9 = __VERIFIER_nondet_long() ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] *tmp___0 = 0 [L1110] EXPR s->info_callback VAL [={0:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->info_callback={1:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=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 [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=12292, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=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 [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] EXPR s->version VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->version=0, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->init_buf={2:-1}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=12292, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=0, init=1, ret=-1, s={20498:0}, s={20498:0}, s->state=4368, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->bbio={0:1}, s->wbio={0:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4368, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=1, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4384, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1320] COND FALSE !(ret <= 0) [L1325] s->hit VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->hit=0, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1325] COND FALSE !(s->hit) [L1328] s->state = 4400 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1330] s->init_num = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4384, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4400, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND TRUE s->state == 4400 [L1334] EXPR s->s3 [L1334] EXPR (s->s3)->tmp.new_cipher [L1334] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={1:0}, ((s->s3)->tmp.new_cipher)->algorithms=20529, (s->s3)->tmp.new_cipher={20511:0}, blastFlag=2, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1334] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1337] ret = __VERIFIER_nondet_int() [L1338] COND TRUE blastFlag == 2 [L1339] blastFlag = 3 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4400, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=3, init=1, ret=1, s={20498:0}, s={20498:0}, s->state=4416, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1371] COND FALSE !(! tmp___6) VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [={1:0}, (s->s3)->tmp.reuse_message=20505, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->s3={20495:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1130] COND TRUE 1 VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4416, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [={1:0}, blastFlag=4, init=1, ret=7, s={20498:0}, s={20498:0}, s->state=4432, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [={1:0}, blastFlag=4, init=1, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L1643] __VERIFIER_error() VAL [={1:0}, blastFlag=4, init=1, ret=0, s={20498:0}, s={20498:0}, skip=0, SSLv3_client_data={20492:0}, state=4432, tmp=0, tmp___0={20498:204}, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 25 OverallIterations, 6 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5115 SDtfs, 2385 SDslu, 6859 SDs, 0 SdLazy, 4108 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 48 SyntacticMatches, 36 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=24, 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.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 1670 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 397585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 1286/1286 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 23:03:51,212 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:03:51,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:03:51,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:03:51,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:03:51,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:03:51,220 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:03:51,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:03:51,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:03:51,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:03:51,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:03:51,222 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:03:51,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:03:51,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:03:51,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:03:51,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:03:51,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:03:51,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:03:51,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:03:51,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:03:51,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:03:51,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:03:51,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:03:51,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:03:51,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:03:51,230 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:03:51,230 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:03:51,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:03:51,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:03:51,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:03:51,232 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:03:51,232 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:03:51,232 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:03:51,232 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:03:51,233 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:03:51,233 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:03:51,233 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 23:03:51,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:03:51,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:03:51,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:03:51,241 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:03:51,241 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 23:03:51,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 23:03:51,241 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 23:03:51,241 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 23:03:51,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:03:51,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:03:51,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:03:51,243 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:03:51,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 23:03:51,244 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 23:03:51,244 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_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c271f3a8f5eeb9abed31f7632ddca02a2bd7f129 [2018-12-08 23:03:51,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:03:51,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:03:51,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:03:51,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:03:51,276 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:03:51,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2018-12-08 23:03:51,322 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/8660d42d3/0ee349fa16d241059d432328d63b887d/FLAGf87095ab2 [2018-12-08 23:03:51,748 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:03:51,748 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/sv-benchmarks/c/ssh/s3_clnt.blast.04_false-unreach-call.i.cil.c [2018-12-08 23:03:51,757 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/8660d42d3/0ee349fa16d241059d432328d63b887d/FLAGf87095ab2 [2018-12-08 23:03:51,765 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_70241efe-3d5f-490a-8f74-88af75016527/bin-2019/utaipan/data/8660d42d3/0ee349fa16d241059d432328d63b887d [2018-12-08 23:03:51,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:03:51,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:03:51,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:03:51,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:03:51,771 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:03:51,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:51" (1/1) ... [2018-12-08 23:03:51,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe4fc2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:03:51, skipping insertion in model container [2018-12-08 23:03:51,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:03:51" (1/1) ... [2018-12-08 23:03:51,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:03:51,805 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:03:52,007 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:03:52,019 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:03:52,115 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:03:52,115 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-08 23:03:52,118 INFO L168 Benchmark]: Toolchain (without parser) took 350.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:52,119 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 23:03:52,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2018-12-08 23:03:52,120 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 348.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -177.5 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...