./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_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_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/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 734374bd08e5d81d02921a162508af5871b3609e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/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 734374bd08e5d81d02921a162508af5871b3609e ......................................................................................................................................................................... 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-01 22:57:37,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:57:37,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:57:37,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:57:37,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:57:37,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:57:37,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:57:37,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:57:37,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:57:37,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:57:37,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:57:37,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:57:37,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:57:37,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:57:37,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:57:37,590 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:57:37,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:57:37,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:57:37,593 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:57:37,594 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:57:37,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:57:37,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:57:37,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:57:37,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:57:37,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:57:37,598 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:57:37,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:57:37,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:57:37,600 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:57:37,601 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:57:37,601 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:57:37,601 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:57:37,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:57:37,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:57:37,602 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:57:37,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:57:37,603 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-01 22:57:37,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:57:37,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:57:37,614 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:57:37,614 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:57:37,614 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 22:57:37,614 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 22:57:37,614 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 22:57:37,614 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 22:57:37,615 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:57:37,615 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:57:37,616 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:57:37,617 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:57:37,617 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:57:37,617 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:57:37,618 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-01 22:57:37,618 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_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/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 -> 734374bd08e5d81d02921a162508af5871b3609e [2018-12-01 22:57:37,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:57:37,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:57:37,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:57:37,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:57:37,653 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:57:37,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-01 22:57:37,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/77c88aad1/d59dfb4bc0a9403e84782e4314d6768d/FLAGbdd54f91a [2018-12-01 22:57:38,113 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:57:38,113 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-01 22:57:38,122 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/77c88aad1/d59dfb4bc0a9403e84782e4314d6768d/FLAGbdd54f91a [2018-12-01 22:57:38,446 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/77c88aad1/d59dfb4bc0a9403e84782e4314d6768d [2018-12-01 22:57:38,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:57:38,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:57:38,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:57:38,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:57:38,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:57:38,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe15e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38, skipping insertion in model container [2018-12-01 22:57:38,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:57:38,564 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:57:38,804 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:57:38,813 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:57:38,867 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:57:38,879 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:57:38,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38 WrapperNode [2018-12-01 22:57:38,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:57:38,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:57:38,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:57:38,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:57:38,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:57:38,903 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:57:38,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:57:38,904 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:57:38,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... [2018-12-01 22:57:38,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:57:38,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:57:38,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:57:38,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:57:38,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/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-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:57:38,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:57:38,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 22:57:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 22:57:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 22:57:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-01 22:57:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-01 22:57:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:57:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:57:38,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:57:38,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:57:39,170 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-01 22:57:39,170 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-01 22:57:39,526 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:57:39,526 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 22:57:39,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:57:39 BoogieIcfgContainer [2018-12-01 22:57:39,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:57:39,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:57:39,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:57:39,529 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:57:39,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:57:38" (1/3) ... [2018-12-01 22:57:39,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db9d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:57:39, skipping insertion in model container [2018-12-01 22:57:39,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:38" (2/3) ... [2018-12-01 22:57:39,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db9d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:57:39, skipping insertion in model container [2018-12-01 22:57:39,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:57:39" (3/3) ... [2018-12-01 22:57:39,531 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-01 22:57:39,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:57:39,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 22:57:39,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 22:57:39,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:57:39,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:57:39,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:57:39,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:57:39,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:57:39,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:57:39,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:57:39,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:57:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2018-12-01 22:57:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 22:57:39,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:39,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:39,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:39,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:39,590 INFO L82 PathProgramCache]: Analyzing trace with hash -159093021, now seen corresponding path program 1 times [2018-12-01 22:57:39,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:39,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:39,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:39,771 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-01 22:57:39,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:39,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:39,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:39,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:39,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:39,786 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 4 states. [2018-12-01 22:57:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:40,044 INFO L93 Difference]: Finished difference Result 323 states and 538 transitions. [2018-12-01 22:57:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:40,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-01 22:57:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:40,056 INFO L225 Difference]: With dead ends: 323 [2018-12-01 22:57:40,056 INFO L226 Difference]: Without dead ends: 164 [2018-12-01 22:57:40,060 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-01 22:57:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-01 22:57:40,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-12-01 22:57:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-01 22:57:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 222 transitions. [2018-12-01 22:57:40,088 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 222 transitions. Word has length 51 [2018-12-01 22:57:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:40,089 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 222 transitions. [2018-12-01 22:57:40,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-12-01 22:57:40,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-01 22:57:40,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:40,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:40,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:40,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1249544262, now seen corresponding path program 1 times [2018-12-01 22:57:40,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:40,199 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-01 22:57:40,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:40,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:40,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:40,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:40,201 INFO L87 Difference]: Start difference. First operand 147 states and 222 transitions. Second operand 4 states. [2018-12-01 22:57:40,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:40,389 INFO L93 Difference]: Finished difference Result 286 states and 429 transitions. [2018-12-01 22:57:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:40,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-01 22:57:40,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:40,390 INFO L225 Difference]: With dead ends: 286 [2018-12-01 22:57:40,390 INFO L226 Difference]: Without dead ends: 164 [2018-12-01 22:57:40,391 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-01 22:57:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-01 22:57:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2018-12-01 22:57:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-01 22:57:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 221 transitions. [2018-12-01 22:57:40,397 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 221 transitions. Word has length 64 [2018-12-01 22:57:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:40,398 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 221 transitions. [2018-12-01 22:57:40,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 221 transitions. [2018-12-01 22:57:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:57:40,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:40,399 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:40,399 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:40,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:40,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2088335094, now seen corresponding path program 1 times [2018-12-01 22:57:40,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:40,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:40,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:40,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:57:40,496 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:57:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:57:40,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:57:40,497 INFO L87 Difference]: Start difference. First operand 147 states and 221 transitions. Second operand 5 states. [2018-12-01 22:57:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:40,781 INFO L93 Difference]: Finished difference Result 290 states and 437 transitions. [2018-12-01 22:57:40,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:57:40,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-01 22:57:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:40,783 INFO L225 Difference]: With dead ends: 290 [2018-12-01 22:57:40,783 INFO L226 Difference]: Without dead ends: 168 [2018-12-01 22:57:40,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:57:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-01 22:57:40,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-12-01 22:57:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-01 22:57:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2018-12-01 22:57:40,790 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 65 [2018-12-01 22:57:40,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:40,790 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2018-12-01 22:57:40,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:57:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2018-12-01 22:57:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:57:40,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:40,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:40,792 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:40,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:40,792 INFO L82 PathProgramCache]: Analyzing trace with hash -131916627, now seen corresponding path program 1 times [2018-12-01 22:57:40,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:40,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:40,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:40,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:40,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:40,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:40,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:40,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:40,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:40,847 INFO L87 Difference]: Start difference. First operand 167 states and 247 transitions. Second operand 4 states. [2018-12-01 22:57:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:41,020 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2018-12-01 22:57:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:41,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-01 22:57:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:41,022 INFO L225 Difference]: With dead ends: 323 [2018-12-01 22:57:41,022 INFO L226 Difference]: Without dead ends: 181 [2018-12-01 22:57:41,023 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-01 22:57:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-01 22:57:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2018-12-01 22:57:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-01 22:57:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 246 transitions. [2018-12-01 22:57:41,030 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 246 transitions. Word has length 65 [2018-12-01 22:57:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:41,030 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 246 transitions. [2018-12-01 22:57:41,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 246 transitions. [2018-12-01 22:57:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:57:41,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:41,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:41,032 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:41,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash 368734894, now seen corresponding path program 1 times [2018-12-01 22:57:41,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:41,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:41,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:41,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:41,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:41,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:41,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:41,082 INFO L87 Difference]: Start difference. First operand 167 states and 246 transitions. Second operand 4 states. [2018-12-01 22:57:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:41,228 INFO L93 Difference]: Finished difference Result 322 states and 475 transitions. [2018-12-01 22:57:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:41,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-01 22:57:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:41,229 INFO L225 Difference]: With dead ends: 322 [2018-12-01 22:57:41,229 INFO L226 Difference]: Without dead ends: 180 [2018-12-01 22:57:41,230 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-01 22:57:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-01 22:57:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-01 22:57:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-01 22:57:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2018-12-01 22:57:41,235 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 65 [2018-12-01 22:57:41,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:41,236 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2018-12-01 22:57:41,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2018-12-01 22:57:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-01 22:57:41,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:41,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:41,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:41,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash -308767357, now seen corresponding path program 1 times [2018-12-01 22:57:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:41,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:41,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:41,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:41,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:41,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:41,282 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand 4 states. [2018-12-01 22:57:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:41,420 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2018-12-01 22:57:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:41,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-01 22:57:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:41,421 INFO L225 Difference]: With dead ends: 322 [2018-12-01 22:57:41,421 INFO L226 Difference]: Without dead ends: 180 [2018-12-01 22:57:41,421 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-01 22:57:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-01 22:57:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-01 22:57:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-01 22:57:41,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 244 transitions. [2018-12-01 22:57:41,425 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 244 transitions. Word has length 66 [2018-12-01 22:57:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:41,426 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 244 transitions. [2018-12-01 22:57:41,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 244 transitions. [2018-12-01 22:57:41,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-01 22:57:41,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:41,426 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:41,427 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:41,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -904921750, now seen corresponding path program 1 times [2018-12-01 22:57:41,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:41,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:41,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:41,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:41,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:41,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:41,476 INFO L87 Difference]: Start difference. First operand 167 states and 244 transitions. Second operand 4 states. [2018-12-01 22:57:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:41,625 INFO L93 Difference]: Finished difference Result 322 states and 473 transitions. [2018-12-01 22:57:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:41,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-01 22:57:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:41,626 INFO L225 Difference]: With dead ends: 322 [2018-12-01 22:57:41,626 INFO L226 Difference]: Without dead ends: 180 [2018-12-01 22:57:41,626 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-01 22:57:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-01 22:57:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 167. [2018-12-01 22:57:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-01 22:57:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2018-12-01 22:57:41,630 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 67 [2018-12-01 22:57:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:41,630 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2018-12-01 22:57:41,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2018-12-01 22:57:41,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 22:57:41,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:41,630 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:41,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1747569565, now seen corresponding path program 1 times [2018-12-01 22:57:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:41,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:41,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:41,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:41,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:41,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:41,666 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand 4 states. [2018-12-01 22:57:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:41,814 INFO L93 Difference]: Finished difference Result 351 states and 519 transitions. [2018-12-01 22:57:41,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:41,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-01 22:57:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:41,815 INFO L225 Difference]: With dead ends: 351 [2018-12-01 22:57:41,815 INFO L226 Difference]: Without dead ends: 209 [2018-12-01 22:57:41,816 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-01 22:57:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-01 22:57:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-12-01 22:57:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2018-12-01 22:57:41,819 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 68 [2018-12-01 22:57:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:41,820 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2018-12-01 22:57:41,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2018-12-01 22:57:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-01 22:57:41,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:41,820 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:41,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:41,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:41,821 INFO L82 PathProgramCache]: Analyzing trace with hash 886427902, now seen corresponding path program 1 times [2018-12-01 22:57:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:41,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:41,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:41,850 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand 4 states. [2018-12-01 22:57:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:42,011 INFO L93 Difference]: Finished difference Result 366 states and 546 transitions. [2018-12-01 22:57:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:42,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-01 22:57:42,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:42,013 INFO L225 Difference]: With dead ends: 366 [2018-12-01 22:57:42,013 INFO L226 Difference]: Without dead ends: 202 [2018-12-01 22:57:42,014 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-01 22:57:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-01 22:57:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2018-12-01 22:57:42,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:42,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 279 transitions. [2018-12-01 22:57:42,021 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 279 transitions. Word has length 68 [2018-12-01 22:57:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:42,022 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 279 transitions. [2018-12-01 22:57:42,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 279 transitions. [2018-12-01 22:57:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-01 22:57:42,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:42,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:42,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:42,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:42,024 INFO L82 PathProgramCache]: Analyzing trace with hash -619008379, now seen corresponding path program 1 times [2018-12-01 22:57:42,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:42,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:42,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:42,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:42,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:42,083 INFO L87 Difference]: Start difference. First operand 189 states and 279 transitions. Second operand 4 states. [2018-12-01 22:57:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:42,255 INFO L93 Difference]: Finished difference Result 356 states and 533 transitions. [2018-12-01 22:57:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:42,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-12-01 22:57:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:42,256 INFO L225 Difference]: With dead ends: 356 [2018-12-01 22:57:42,256 INFO L226 Difference]: Without dead ends: 192 [2018-12-01 22:57:42,257 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-01 22:57:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-01 22:57:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2018-12-01 22:57:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2018-12-01 22:57:42,263 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 69 [2018-12-01 22:57:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:42,263 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2018-12-01 22:57:42,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2018-12-01 22:57:42,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-01 22:57:42,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:42,264 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:42,264 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:42,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:42,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1016015308, now seen corresponding path program 1 times [2018-12-01 22:57:42,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:42,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:42,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:42,315 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand 4 states. [2018-12-01 22:57:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:42,514 INFO L93 Difference]: Finished difference Result 373 states and 553 transitions. [2018-12-01 22:57:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:42,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-01 22:57:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:42,515 INFO L225 Difference]: With dead ends: 373 [2018-12-01 22:57:42,516 INFO L226 Difference]: Without dead ends: 209 [2018-12-01 22:57:42,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:57:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-01 22:57:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2018-12-01 22:57:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2018-12-01 22:57:42,524 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 81 [2018-12-01 22:57:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:42,524 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2018-12-01 22:57:42,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2018-12-01 22:57:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 22:57:42,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:42,526 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:42,526 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:42,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:42,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1218620391, now seen corresponding path program 1 times [2018-12-01 22:57:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:42,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:42,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:42,584 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:42,584 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand 4 states. [2018-12-01 22:57:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:42,775 INFO L93 Difference]: Finished difference Result 371 states and 549 transitions. [2018-12-01 22:57:42,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:42,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-01 22:57:42,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:42,776 INFO L225 Difference]: With dead ends: 371 [2018-12-01 22:57:42,776 INFO L226 Difference]: Without dead ends: 207 [2018-12-01 22:57:42,777 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-01 22:57:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-01 22:57:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2018-12-01 22:57:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:42,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2018-12-01 22:57:42,781 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 82 [2018-12-01 22:57:42,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:42,782 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2018-12-01 22:57:42,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:42,782 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2018-12-01 22:57:42,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-01 22:57:42,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:42,783 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:42,783 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:42,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:42,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1719271912, now seen corresponding path program 1 times [2018-12-01 22:57:42,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:42,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:42,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:42,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:42,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:42,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:42,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:42,826 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand 4 states. [2018-12-01 22:57:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:43,000 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-01 22:57:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:43,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-01 22:57:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:43,001 INFO L225 Difference]: With dead ends: 370 [2018-12-01 22:57:43,001 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 22:57:43,001 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-01 22:57:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 22:57:43,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-01 22:57:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2018-12-01 22:57:43,006 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 82 [2018-12-01 22:57:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:43,006 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2018-12-01 22:57:43,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2018-12-01 22:57:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-01 22:57:43,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:43,006 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:43,006 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:43,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1391792759, now seen corresponding path program 1 times [2018-12-01 22:57:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:43,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:43,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:43,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:43,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:43,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:43,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:43,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,049 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand 4 states. [2018-12-01 22:57:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:43,229 INFO L93 Difference]: Finished difference Result 370 states and 544 transitions. [2018-12-01 22:57:43,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:43,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-01 22:57:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:43,230 INFO L225 Difference]: With dead ends: 370 [2018-12-01 22:57:43,230 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 22:57:43,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 22:57:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-01 22:57:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 274 transitions. [2018-12-01 22:57:43,237 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 274 transitions. Word has length 83 [2018-12-01 22:57:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:43,237 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 274 transitions. [2018-12-01 22:57:43,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 274 transitions. [2018-12-01 22:57:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-01 22:57:43,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:43,238 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:43,238 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:43,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash -118970844, now seen corresponding path program 1 times [2018-12-01 22:57:43,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:43,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:43,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:43,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:43,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,286 INFO L87 Difference]: Start difference. First operand 189 states and 274 transitions. Second operand 4 states. [2018-12-01 22:57:43,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:43,455 INFO L93 Difference]: Finished difference Result 370 states and 542 transitions. [2018-12-01 22:57:43,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:43,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-01 22:57:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:43,456 INFO L225 Difference]: With dead ends: 370 [2018-12-01 22:57:43,456 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 22:57:43,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 22:57:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-01 22:57:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2018-12-01 22:57:43,461 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 84 [2018-12-01 22:57:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:43,461 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2018-12-01 22:57:43,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2018-12-01 22:57:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-01 22:57:43,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:43,462 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:43,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:43,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash -518897788, now seen corresponding path program 1 times [2018-12-01 22:57:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:43,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:43,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:43,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:43,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:43,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:43,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,499 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 4 states. [2018-12-01 22:57:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:43,671 INFO L93 Difference]: Finished difference Result 370 states and 540 transitions. [2018-12-01 22:57:43,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:43,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-01 22:57:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:43,672 INFO L225 Difference]: With dead ends: 370 [2018-12-01 22:57:43,672 INFO L226 Difference]: Without dead ends: 206 [2018-12-01 22:57:43,673 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-01 22:57:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-01 22:57:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2018-12-01 22:57:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 272 transitions. [2018-12-01 22:57:43,677 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 272 transitions. Word has length 85 [2018-12-01 22:57:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:43,677 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 272 transitions. [2018-12-01 22:57:43,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 272 transitions. [2018-12-01 22:57:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-01 22:57:43,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:43,678 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:43,678 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:43,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1234431809, now seen corresponding path program 1 times [2018-12-01 22:57:43,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:43,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:57:43,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:43,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:43,718 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:43,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,718 INFO L87 Difference]: Start difference. First operand 189 states and 272 transitions. Second operand 4 states. [2018-12-01 22:57:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:43,867 INFO L93 Difference]: Finished difference Result 360 states and 526 transitions. [2018-12-01 22:57:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:43,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-12-01 22:57:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:43,868 INFO L225 Difference]: With dead ends: 360 [2018-12-01 22:57:43,868 INFO L226 Difference]: Without dead ends: 196 [2018-12-01 22:57:43,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-01 22:57:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2018-12-01 22:57:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-01 22:57:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 271 transitions. [2018-12-01 22:57:43,873 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 271 transitions. Word has length 86 [2018-12-01 22:57:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:43,874 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 271 transitions. [2018-12-01 22:57:43,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:43,874 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 271 transitions. [2018-12-01 22:57:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 22:57:43,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:43,875 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:43,875 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:43,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1816830103, now seen corresponding path program 1 times [2018-12-01 22:57:43,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:43,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:43,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:43,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:43,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:43,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:43,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:43,916 INFO L87 Difference]: Start difference. First operand 189 states and 271 transitions. Second operand 4 states. [2018-12-01 22:57:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:44,156 INFO L93 Difference]: Finished difference Result 448 states and 660 transitions. [2018-12-01 22:57:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:44,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-01 22:57:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:44,157 INFO L225 Difference]: With dead ends: 448 [2018-12-01 22:57:44,157 INFO L226 Difference]: Without dead ends: 284 [2018-12-01 22:57:44,158 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-01 22:57:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-01 22:57:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2018-12-01 22:57:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-01 22:57:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 348 transitions. [2018-12-01 22:57:44,163 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 348 transitions. Word has length 90 [2018-12-01 22:57:44,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:44,163 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 348 transitions. [2018-12-01 22:57:44,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 348 transitions. [2018-12-01 22:57:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-01 22:57:44,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:44,164 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:44,164 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:44,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash 919436825, now seen corresponding path program 1 times [2018-12-01 22:57:44,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:44,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:44,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:44,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:44,207 INFO L87 Difference]: Start difference. First operand 232 states and 348 transitions. Second operand 4 states. [2018-12-01 22:57:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:44,569 INFO L93 Difference]: Finished difference Result 487 states and 740 transitions. [2018-12-01 22:57:44,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:44,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-12-01 22:57:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:44,572 INFO L225 Difference]: With dead ends: 487 [2018-12-01 22:57:44,573 INFO L226 Difference]: Without dead ends: 280 [2018-12-01 22:57:44,573 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-01 22:57:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-01 22:57:44,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-01 22:57:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2018-12-01 22:57:44,597 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2018-12-01 22:57:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:44,597 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2018-12-01 22:57:44,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2018-12-01 22:57:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 22:57:44,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:44,599 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:44,599 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:44,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 704494354, now seen corresponding path program 1 times [2018-12-01 22:57:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:44,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:44,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:44,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:44,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:44,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:44,651 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2018-12-01 22:57:44,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:44,908 INFO L93 Difference]: Finished difference Result 539 states and 818 transitions. [2018-12-01 22:57:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:44,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-01 22:57:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:44,909 INFO L225 Difference]: With dead ends: 539 [2018-12-01 22:57:44,909 INFO L226 Difference]: Without dead ends: 308 [2018-12-01 22:57:44,910 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-01 22:57:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-01 22:57:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 256. [2018-12-01 22:57:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2018-12-01 22:57:44,919 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 103 [2018-12-01 22:57:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:44,919 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2018-12-01 22:57:44,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2018-12-01 22:57:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-01 22:57:44,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:44,920 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:44,920 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:44,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash 745169104, now seen corresponding path program 1 times [2018-12-01 22:57:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:44,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:44,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:44,970 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:44,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:44,971 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2018-12-01 22:57:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:45,193 INFO L93 Difference]: Finished difference Result 511 states and 778 transitions. [2018-12-01 22:57:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:45,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-01 22:57:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:45,195 INFO L225 Difference]: With dead ends: 511 [2018-12-01 22:57:45,195 INFO L226 Difference]: Without dead ends: 280 [2018-12-01 22:57:45,195 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-01 22:57:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-01 22:57:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2018-12-01 22:57:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2018-12-01 22:57:45,200 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 103 [2018-12-01 22:57:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:45,201 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2018-12-01 22:57:45,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2018-12-01 22:57:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:57:45,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:45,201 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:45,201 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:45,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash 151405409, now seen corresponding path program 1 times [2018-12-01 22:57:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:45,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:45,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:45,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:45,240 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2018-12-01 22:57:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:45,466 INFO L93 Difference]: Finished difference Result 537 states and 812 transitions. [2018-12-01 22:57:45,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:45,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-01 22:57:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:45,468 INFO L225 Difference]: With dead ends: 537 [2018-12-01 22:57:45,468 INFO L226 Difference]: Without dead ends: 306 [2018-12-01 22:57:45,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:57:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-01 22:57:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 256. [2018-12-01 22:57:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2018-12-01 22:57:45,477 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 104 [2018-12-01 22:57:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:45,478 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2018-12-01 22:57:45,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2018-12-01 22:57:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:57:45,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:45,479 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:45,479 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:45,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:45,479 INFO L82 PathProgramCache]: Analyzing trace with hash 652056930, now seen corresponding path program 1 times [2018-12-01 22:57:45,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:45,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:45,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:45,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:45,533 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2018-12-01 22:57:45,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:45,750 INFO L93 Difference]: Finished difference Result 536 states and 809 transitions. [2018-12-01 22:57:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:45,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-01 22:57:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:45,751 INFO L225 Difference]: With dead ends: 536 [2018-12-01 22:57:45,751 INFO L226 Difference]: Without dead ends: 305 [2018-12-01 22:57:45,751 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-01 22:57:45,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-01 22:57:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-01 22:57:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2018-12-01 22:57:45,757 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 104 [2018-12-01 22:57:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:45,757 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2018-12-01 22:57:45,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2018-12-01 22:57:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:57:45,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:45,757 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:45,758 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:45,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1412322659, now seen corresponding path program 1 times [2018-12-01 22:57:45,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:45,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:45,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:45,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:45,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:45,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:45,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:45,802 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2018-12-01 22:57:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:45,967 INFO L93 Difference]: Finished difference Result 509 states and 770 transitions. [2018-12-01 22:57:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:45,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-01 22:57:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:45,968 INFO L225 Difference]: With dead ends: 509 [2018-12-01 22:57:45,968 INFO L226 Difference]: Without dead ends: 278 [2018-12-01 22:57:45,968 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-01 22:57:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-01 22:57:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2018-12-01 22:57:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2018-12-01 22:57:45,974 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 104 [2018-12-01 22:57:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:45,974 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2018-12-01 22:57:45,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2018-12-01 22:57:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:57:45,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:45,975 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:45,975 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:45,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1912974180, now seen corresponding path program 1 times [2018-12-01 22:57:45,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:45,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:46,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:46,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:46,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:46,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:46,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:46,007 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2018-12-01 22:57:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:46,155 INFO L93 Difference]: Finished difference Result 508 states and 767 transitions. [2018-12-01 22:57:46,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:46,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-01 22:57:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:46,157 INFO L225 Difference]: With dead ends: 508 [2018-12-01 22:57:46,157 INFO L226 Difference]: Without dead ends: 277 [2018-12-01 22:57:46,157 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-01 22:57:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-01 22:57:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-01 22:57:46,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:46,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2018-12-01 22:57:46,163 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 104 [2018-12-01 22:57:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:46,163 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2018-12-01 22:57:46,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2018-12-01 22:57:46,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-01 22:57:46,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:46,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:46,164 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:46,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:46,165 INFO L82 PathProgramCache]: Analyzing trace with hash -115718833, now seen corresponding path program 1 times [2018-12-01 22:57:46,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:46,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:46,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:46,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:46,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:46,195 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2018-12-01 22:57:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:46,416 INFO L93 Difference]: Finished difference Result 536 states and 803 transitions. [2018-12-01 22:57:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:46,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-01 22:57:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:46,417 INFO L225 Difference]: With dead ends: 536 [2018-12-01 22:57:46,418 INFO L226 Difference]: Without dead ends: 305 [2018-12-01 22:57:46,418 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-01 22:57:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-01 22:57:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-01 22:57:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2018-12-01 22:57:46,428 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 105 [2018-12-01 22:57:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:46,428 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2018-12-01 22:57:46,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2018-12-01 22:57:46,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-01 22:57:46,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:46,429 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:46,429 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:46,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash 318010253, now seen corresponding path program 1 times [2018-12-01 22:57:46,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:46,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:46,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:46,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:46,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:46,481 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2018-12-01 22:57:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:46,660 INFO L93 Difference]: Finished difference Result 508 states and 763 transitions. [2018-12-01 22:57:46,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:46,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-01 22:57:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:46,661 INFO L225 Difference]: With dead ends: 508 [2018-12-01 22:57:46,661 INFO L226 Difference]: Without dead ends: 277 [2018-12-01 22:57:46,661 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-01 22:57:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-01 22:57:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-01 22:57:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:46,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2018-12-01 22:57:46,666 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 105 [2018-12-01 22:57:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:46,667 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2018-12-01 22:57:46,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2018-12-01 22:57:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 22:57:46,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:46,667 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:46,667 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:46,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:46,667 INFO L82 PathProgramCache]: Analyzing trace with hash 784615198, now seen corresponding path program 1 times [2018-12-01 22:57:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:46,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:46,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:46,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:46,699 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:46,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:46,699 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2018-12-01 22:57:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:46,906 INFO L93 Difference]: Finished difference Result 536 states and 799 transitions. [2018-12-01 22:57:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:46,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-01 22:57:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:46,907 INFO L225 Difference]: With dead ends: 536 [2018-12-01 22:57:46,907 INFO L226 Difference]: Without dead ends: 305 [2018-12-01 22:57:46,907 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-01 22:57:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-01 22:57:46,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-01 22:57:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2018-12-01 22:57:46,914 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 106 [2018-12-01 22:57:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:46,914 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2018-12-01 22:57:46,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2018-12-01 22:57:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-01 22:57:46,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:46,914 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:46,915 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:46,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:46,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1345314976, now seen corresponding path program 1 times [2018-12-01 22:57:46,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:46,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:46,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:46,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:46,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:46,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:46,960 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2018-12-01 22:57:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:47,106 INFO L93 Difference]: Finished difference Result 508 states and 759 transitions. [2018-12-01 22:57:47,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:47,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-12-01 22:57:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:47,107 INFO L225 Difference]: With dead ends: 508 [2018-12-01 22:57:47,107 INFO L226 Difference]: Without dead ends: 277 [2018-12-01 22:57:47,107 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-01 22:57:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-01 22:57:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-01 22:57:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2018-12-01 22:57:47,113 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 106 [2018-12-01 22:57:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2018-12-01 22:57:47,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2018-12-01 22:57:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-01 22:57:47,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:47,114 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:47,114 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:47,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:47,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1722465738, now seen corresponding path program 1 times [2018-12-01 22:57:47,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:47,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:47,147 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:47,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:47,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:47,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:47,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:47,148 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2018-12-01 22:57:47,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:47,344 INFO L93 Difference]: Finished difference Result 536 states and 795 transitions. [2018-12-01 22:57:47,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:47,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-01 22:57:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:47,345 INFO L225 Difference]: With dead ends: 536 [2018-12-01 22:57:47,346 INFO L226 Difference]: Without dead ends: 305 [2018-12-01 22:57:47,346 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-01 22:57:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-01 22:57:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 256. [2018-12-01 22:57:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2018-12-01 22:57:47,352 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 107 [2018-12-01 22:57:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:47,352 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2018-12-01 22:57:47,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2018-12-01 22:57:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-01 22:57:47,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:47,352 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:47,353 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:47,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:47,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1924289672, now seen corresponding path program 1 times [2018-12-01 22:57:47,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:47,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:47,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:47,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:47,383 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:47,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:47,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:47,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:47,383 INFO L87 Difference]: Start difference. First operand 256 states and 378 transitions. Second operand 4 states. [2018-12-01 22:57:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:47,550 INFO L93 Difference]: Finished difference Result 508 states and 755 transitions. [2018-12-01 22:57:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:47,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-12-01 22:57:47,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:47,551 INFO L225 Difference]: With dead ends: 508 [2018-12-01 22:57:47,551 INFO L226 Difference]: Without dead ends: 277 [2018-12-01 22:57:47,552 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-01 22:57:47,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-01 22:57:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 256. [2018-12-01 22:57:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2018-12-01 22:57:47,558 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 107 [2018-12-01 22:57:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:47,558 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2018-12-01 22:57:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2018-12-01 22:57:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-01 22:57:47,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:47,559 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:47,559 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:47,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash -471639239, now seen corresponding path program 1 times [2018-12-01 22:57:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:47,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:47,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:47,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:47,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:47,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:47,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:47,593 INFO L87 Difference]: Start difference. First operand 256 states and 377 transitions. Second operand 4 states. [2018-12-01 22:57:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:47,783 INFO L93 Difference]: Finished difference Result 526 states and 779 transitions. [2018-12-01 22:57:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:47,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-01 22:57:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:47,783 INFO L225 Difference]: With dead ends: 526 [2018-12-01 22:57:47,784 INFO L226 Difference]: Without dead ends: 295 [2018-12-01 22:57:47,784 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-01 22:57:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-01 22:57:47,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2018-12-01 22:57:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2018-12-01 22:57:47,792 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 108 [2018-12-01 22:57:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:47,792 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2018-12-01 22:57:47,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2018-12-01 22:57:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-01 22:57:47,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:47,793 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:47,793 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:47,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:47,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1489935419, now seen corresponding path program 1 times [2018-12-01 22:57:47,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:47,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:47,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:47,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:47,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:47,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:47,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:47,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:47,829 INFO L87 Difference]: Start difference. First operand 256 states and 376 transitions. Second operand 4 states. [2018-12-01 22:57:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:47,985 INFO L93 Difference]: Finished difference Result 498 states and 739 transitions. [2018-12-01 22:57:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:47,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-12-01 22:57:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:47,986 INFO L225 Difference]: With dead ends: 498 [2018-12-01 22:57:47,986 INFO L226 Difference]: Without dead ends: 267 [2018-12-01 22:57:47,986 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-01 22:57:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-01 22:57:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-01 22:57:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 375 transitions. [2018-12-01 22:57:47,994 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 375 transitions. Word has length 108 [2018-12-01 22:57:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:47,994 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 375 transitions. [2018-12-01 22:57:47,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 375 transitions. [2018-12-01 22:57:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-01 22:57:47,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:47,995 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:47,995 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:47,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:47,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1835731803, now seen corresponding path program 1 times [2018-12-01 22:57:47,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:47,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:47,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-01 22:57:48,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:48,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:57:48,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:48,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:57:48,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:57:48,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:57:48,040 INFO L87 Difference]: Start difference. First operand 256 states and 375 transitions. Second operand 4 states. [2018-12-01 22:57:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:48,286 INFO L93 Difference]: Finished difference Result 526 states and 775 transitions. [2018-12-01 22:57:48,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:57:48,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-01 22:57:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:48,287 INFO L225 Difference]: With dead ends: 526 [2018-12-01 22:57:48,287 INFO L226 Difference]: Without dead ends: 295 [2018-12-01 22:57:48,287 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-01 22:57:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-01 22:57:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 256. [2018-12-01 22:57:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-01 22:57:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2018-12-01 22:57:48,297 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 112 [2018-12-01 22:57:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:48,297 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2018-12-01 22:57:48,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:57:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2018-12-01 22:57:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-01 22:57:48,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:48,298 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:48,298 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:48,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 773055655, now seen corresponding path program 1 times [2018-12-01 22:57:48,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:48,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:48,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:48,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:57:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 22:57:48,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:57:48,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:57:48,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:57:48,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:57:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:57:48,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:57:48,336 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand 3 states. [2018-12-01 22:57:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:57:48,360 INFO L93 Difference]: Finished difference Result 716 states and 1065 transitions. [2018-12-01 22:57:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:57:48,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-01 22:57:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:57:48,361 INFO L225 Difference]: With dead ends: 716 [2018-12-01 22:57:48,361 INFO L226 Difference]: Without dead ends: 485 [2018-12-01 22:57:48,361 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-01 22:57:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-12-01 22:57:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2018-12-01 22:57:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-12-01 22:57:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 717 transitions. [2018-12-01 22:57:48,373 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 717 transitions. Word has length 112 [2018-12-01 22:57:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:57:48,374 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 717 transitions. [2018-12-01 22:57:48,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:57:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 717 transitions. [2018-12-01 22:57:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 22:57:48,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:57:48,374 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:57:48,375 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:57:48,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:57:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1053667786, now seen corresponding path program 1 times [2018-12-01 22:57:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:57:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:48,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:57:48,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:57:48,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:57:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:57:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:57:48,489 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:57:48,533 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24588 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-01 22:57:48,534 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24586 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-01 22:57:48,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:57:48 BoogieIcfgContainer [2018-12-01 22:57:48,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:57:48,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:57:48,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:57:48,587 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:57:48,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:57:39" (3/4) ... [2018-12-01 22:57:48,590 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 22:57:48,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:57:48,591 INFO L168 Benchmark]: Toolchain (without parser) took 10138.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -251.2 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:48,592 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:57:48,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -113.0 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:48,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.50 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-01 22:57:48,592 INFO L168 Benchmark]: Boogie Preprocessor took 46.11 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:48,593 INFO L168 Benchmark]: RCFGBuilder took 576.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.4 MB in the end (delta: 93.5 MB). Peak memory consumption was 93.5 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:48,593 INFO L168 Benchmark]: TraceAbstraction took 9060.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 959.4 MB in the beginning and 1.2 GB in the end (delta: -238.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:48,593 INFO L168 Benchmark]: Witness Printer took 2.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:57:48,595 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 78.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -113.0 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.50 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 46.11 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 576.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.4 MB in the end (delta: 93.5 MB). Peak memory consumption was 93.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9060.09 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 959.4 MB in the beginning and 1.2 GB in the end (delta: -238.8 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 24588 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 24586 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: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24607, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={24587:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 VAL [init=1, malloc(sizeof(SSL))={24596:0}, malloc(sizeof(SSL_CTX))={24609:0}, malloc(sizeof(SSL_SESSION))={24578:0}, malloc(sizeof(struct ssl3_state_st))={24603:0}, s={24596:0}, SSLv3_server_data={24587:0}] [L1075] CALL ssl3_accept(s) VAL [init=1, s={24596:0}, SSLv3_server_data={24587:0}] [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24596:0}, s={24596:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={2:-1}, blastFlag=1, got_new_session=0, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->hit=1, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8656, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1575] COND FALSE !(! tmp___10) VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24598, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->s3={24603:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8656, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=1, s={24596:0}, s={24596:0}, s->state=8672, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=0, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] [L1703] __VERIFIER_error() VAL [={2:-1}, blastFlag=3, got_new_session=1, init=1, ret=0, s={24596:0}, s={24596:0}, skip=0, SSLv3_server_data={24587:0}, state=8672, Time=0, tmp=0, tmp___1=0, tmp___10=1, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 1 error locations. UNSAFE Result, 9.0s OverallTime, 36 OverallIterations, 4 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6806 SDtfs, 1920 SDslu, 9766 SDs, 0 SdLazy, 6239 SolverSat, 305 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 70 SyntacticMatches, 66 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=35, 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, 35 MinimizatonAttempts, 830 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3240 NumberOfCodeBlocks, 3240 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3074 ConstructedInterpolants, 0 QuantifiedInterpolants, 772152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 1434/1434 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-01 22:57:49,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:57:49,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:57:49,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:57:49,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:57:49,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:57:49,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:57:49,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:57:49,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:57:49,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:57:49,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:57:49,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:57:49,887 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:57:49,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:57:49,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:57:49,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:57:49,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:57:49,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:57:49,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:57:49,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:57:49,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:57:49,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:57:49,893 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:57:49,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:57:49,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:57:49,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:57:49,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:57:49,895 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:57:49,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:57:49,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:57:49,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:57:49,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:57:49,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:57:49,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:57:49,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:57:49,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:57:49,897 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-01 22:57:49,905 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:57:49,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:57:49,905 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:57:49,905 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:57:49,905 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 22:57:49,905 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 22:57:49,906 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:57:49,906 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:57:49,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:57:49,907 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:57:49,908 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-01 22:57:49,908 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-01 22:57:49,908 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_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/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 -> 734374bd08e5d81d02921a162508af5871b3609e [2018-12-01 22:57:49,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:57:49,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:57:49,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:57:49,940 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:57:49,940 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:57:49,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-01 22:57:49,984 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/16ff383f3/f45ccc2450a041dca092356417dc60a7/FLAG8b7669be2 [2018-12-01 22:57:50,425 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:57:50,425 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/sv-benchmarks/c/ssh/s3_srvr.blast.03_false-unreach-call.i.cil.c [2018-12-01 22:57:50,434 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/16ff383f3/f45ccc2450a041dca092356417dc60a7/FLAG8b7669be2 [2018-12-01 22:57:50,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1ccf2d9c-f31b-43ad-9064-f489fa7d9ddd/bin-2019/utaipan/data/16ff383f3/f45ccc2450a041dca092356417dc60a7 [2018-12-01 22:57:50,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:57:50,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:57:50,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:57:50,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:57:50,448 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:57:50,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:57:50" (1/1) ... [2018-12-01 22:57:50,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78cb6da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:57:50, skipping insertion in model container [2018-12-01 22:57:50,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:57:50" (1/1) ... [2018-12-01 22:57:50,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:57:50,483 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:57:50,698 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:57:50,709 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:57:50,829 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:57:50,830 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-01 22:57:50,833 INFO L168 Benchmark]: Toolchain (without parser) took 388.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:50,834 INFO L168 Benchmark]: CDTParser took 0.15 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-01 22:57:50,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:57:50,837 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.15 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 386.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 40.7 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...