./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_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_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/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 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/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 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 ............................................................................................................................................................... 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-02 04:40:42,172 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:40:42,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:40:42,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:40:42,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:40:42,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:40:42,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:40:42,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:40:42,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:40:42,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:40:42,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:40:42,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:40:42,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:40:42,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:40:42,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:40:42,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:40:42,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:40:42,185 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:40:42,186 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:40:42,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:40:42,187 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:40:42,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:40:42,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:40:42,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:40:42,189 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:40:42,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:40:42,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:40:42,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:40:42,191 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:40:42,192 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:40:42,192 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:40:42,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:40:42,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:40:42,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:40:42,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:40:42,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:40:42,193 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 04:40:42,200 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:40:42,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:40:42,201 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:40:42,201 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:40:42,201 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:40:42,201 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:40:42,201 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:40:42,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:40:42,202 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:40:42,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:40:42,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:40:42,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 04:40:42,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 04:40:42,204 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_26fea782-937f-4201-a634-0fb61c17ae6b/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 -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-12-02 04:40:42,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:40:42,231 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:40:42,234 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:40:42,235 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:40:42,236 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:40:42,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-02 04:40:42,279 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/8137e1241/9a51d78fe3af4b568fdaa291c1bac297/FLAGff0b66c2b [2018-12-02 04:40:42,772 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:40:42,772 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-02 04:40:42,781 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/8137e1241/9a51d78fe3af4b568fdaa291c1bac297/FLAGff0b66c2b [2018-12-02 04:40:42,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/8137e1241/9a51d78fe3af4b568fdaa291c1bac297 [2018-12-02 04:40:42,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:40:42,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:40:42,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:40:42,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:40:42,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:40:42,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:40:42" (1/1) ... [2018-12-02 04:40:42,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630b4775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:42, skipping insertion in model container [2018-12-02 04:40:42,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:40:42" (1/1) ... [2018-12-02 04:40:42,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:40:42,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:40:43,098 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:40:43,106 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:40:43,160 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:40:43,171 INFO L195 MainTranslator]: Completed translation [2018-12-02 04:40:43,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43 WrapperNode [2018-12-02 04:40:43,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 04:40:43,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 04:40:43,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 04:40:43,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 04:40:43,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 04:40:43,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 04:40:43,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 04:40:43,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 04:40:43,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... [2018-12-02 04:40:43,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 04:40:43,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 04:40:43,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 04:40:43,243 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 04:40:43,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/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-02 04:40:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 04:40:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 04:40:43,283 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 04:40:43,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 04:40:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 04:40:43,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 04:40:43,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 04:40:43,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 04:40:43,481 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 04:40:43,481 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 04:40:43,847 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 04:40:43,848 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 04:40:43,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:40:43 BoogieIcfgContainer [2018-12-02 04:40:43,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 04:40:43,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 04:40:43,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 04:40:43,851 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 04:40:43,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 04:40:42" (1/3) ... [2018-12-02 04:40:43,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afdceb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:40:43, skipping insertion in model container [2018-12-02 04:40:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:43" (2/3) ... [2018-12-02 04:40:43,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afdceb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 04:40:43, skipping insertion in model container [2018-12-02 04:40:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:40:43" (3/3) ... [2018-12-02 04:40:43,854 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-02 04:40:43,862 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 04:40:43,867 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 04:40:43,876 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 04:40:43,894 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 04:40:43,894 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 04:40:43,894 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 04:40:43,894 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 04:40:43,894 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 04:40:43,894 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 04:40:43,894 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 04:40:43,894 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 04:40:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-02 04:40:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 04:40:43,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:43,911 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] [2018-12-02 04:40:43,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:43,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -995657757, now seen corresponding path program 1 times [2018-12-02 04:40:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:43,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:43,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:43,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:44,117 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-02 04:40:44,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:44,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:44,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:44,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:44,138 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-02 04:40:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:44,395 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-02 04:40:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:44,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-12-02 04:40:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:44,407 INFO L225 Difference]: With dead ends: 333 [2018-12-02 04:40:44,407 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 04:40:44,410 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-02 04:40:44,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 04:40:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 04:40:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 04:40:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-02 04:40:44,439 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 41 [2018-12-02 04:40:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:44,440 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-02 04:40:44,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-02 04:40:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 04:40:44,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:44,441 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] [2018-12-02 04:40:44,441 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:44,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:44,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1978591950, now seen corresponding path program 1 times [2018-12-02 04:40:44,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:44,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:44,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:44,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:44,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:44,512 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-02 04:40:44,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:44,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:44,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:44,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:44,514 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-02 04:40:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:44,709 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-02 04:40:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:44,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-02 04:40:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:44,710 INFO L225 Difference]: With dead ends: 296 [2018-12-02 04:40:44,710 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 04:40:44,711 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-02 04:40:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 04:40:44,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 04:40:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 04:40:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-02 04:40:44,717 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 54 [2018-12-02 04:40:44,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:44,717 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-02 04:40:44,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:44,717 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-02 04:40:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 04:40:44,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:44,718 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] [2018-12-02 04:40:44,718 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:44,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:44,719 INFO L82 PathProgramCache]: Analyzing trace with hash -659098542, now seen corresponding path program 1 times [2018-12-02 04:40:44,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:44,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:44,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:44,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:44,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:44,777 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-02 04:40:44,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:44,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 04:40:44,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:44,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 04:40:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 04:40:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:40:44,779 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-02 04:40:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:45,089 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-02 04:40:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 04:40:45,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 04:40:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:45,091 INFO L225 Difference]: With dead ends: 300 [2018-12-02 04:40:45,091 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 04:40:45,091 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-02 04:40:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 04:40:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-02 04:40:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 04:40:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-02 04:40:45,097 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 55 [2018-12-02 04:40:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:45,097 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-02 04:40:45,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 04:40:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-02 04:40:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 04:40:45,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:45,098 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] [2018-12-02 04:40:45,098 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1162543817, now seen corresponding path program 1 times [2018-12-02 04:40:45,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:45,139 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-02 04:40:45,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:45,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:45,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:45,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:45,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:45,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:45,140 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-02 04:40:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:45,272 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-02 04:40:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:45,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 04:40:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:45,273 INFO L225 Difference]: With dead ends: 333 [2018-12-02 04:40:45,273 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 04:40:45,274 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-02 04:40:45,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 04:40:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-02 04:40:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 04:40:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-02 04:40:45,279 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 55 [2018-12-02 04:40:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:45,279 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-02 04:40:45,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-02 04:40:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 04:40:45,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:45,280 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] [2018-12-02 04:40:45,280 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:45,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:45,280 INFO L82 PathProgramCache]: Analyzing trace with hash -480987638, now seen corresponding path program 1 times [2018-12-02 04:40:45,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:45,314 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-02 04:40:45,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:45,314 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:45,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:45,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:45,315 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-02 04:40:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:45,456 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-02 04:40:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:45,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-02 04:40:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:45,457 INFO L225 Difference]: With dead ends: 332 [2018-12-02 04:40:45,457 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 04:40:45,457 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-02 04:40:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 04:40:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 04:40:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 04:40:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-02 04:40:45,462 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 55 [2018-12-02 04:40:45,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:45,462 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-02 04:40:45,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-02 04:40:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 04:40:45,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:45,462 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] [2018-12-02 04:40:45,463 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:45,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2014271313, now seen corresponding path program 1 times [2018-12-02 04:40:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:45,494 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-02 04:40:45,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:45,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:45,495 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:45,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:45,495 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-02 04:40:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:45,639 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-02 04:40:45,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:45,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-02 04:40:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:45,640 INFO L225 Difference]: With dead ends: 332 [2018-12-02 04:40:45,640 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 04:40:45,640 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-02 04:40:45,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 04:40:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 04:40:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 04:40:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-02 04:40:45,645 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 56 [2018-12-02 04:40:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:45,645 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-02 04:40:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-02 04:40:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 04:40:45,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:45,646 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] [2018-12-02 04:40:45,646 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -515871290, now seen corresponding path program 1 times [2018-12-02 04:40:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:45,682 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-02 04:40:45,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:45,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:45,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:45,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:45,683 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-02 04:40:45,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:45,856 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-02 04:40:45,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:45,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-02 04:40:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:45,857 INFO L225 Difference]: With dead ends: 332 [2018-12-02 04:40:45,857 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 04:40:45,857 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-02 04:40:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 04:40:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 04:40:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 04:40:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-02 04:40:45,864 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 57 [2018-12-02 04:40:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:45,864 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-02 04:40:45,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-02 04:40:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 04:40:45,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:45,865 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] [2018-12-02 04:40:45,865 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:45,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash -623975095, now seen corresponding path program 1 times [2018-12-02 04:40:45,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:45,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:45,915 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-02 04:40:45,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:45,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:45,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:45,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:45,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:45,917 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-02 04:40:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:46,073 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-02 04:40:46,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:46,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 04:40:46,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:46,075 INFO L225 Difference]: With dead ends: 361 [2018-12-02 04:40:46,075 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 04:40:46,075 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-02 04:40:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 04:40:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 04:40:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-02 04:40:46,081 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 58 [2018-12-02 04:40:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:46,082 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-02 04:40:46,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:46,082 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-02 04:40:46,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 04:40:46,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:46,083 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] [2018-12-02 04:40:46,083 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:46,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1702821866, now seen corresponding path program 1 times [2018-12-02 04:40:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:46,129 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-02 04:40:46,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:46,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:46,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:46,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:46,131 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-02 04:40:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:46,261 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-02 04:40:46,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:46,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 04:40:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:46,262 INFO L225 Difference]: With dead ends: 376 [2018-12-02 04:40:46,262 INFO L226 Difference]: Without dead ends: 207 [2018-12-02 04:40:46,263 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-02 04:40:46,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-02 04:40:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-02 04:40:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-02 04:40:46,267 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 58 [2018-12-02 04:40:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:46,267 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-02 04:40:46,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-02 04:40:46,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 04:40:46,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:46,268 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] [2018-12-02 04:40:46,268 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:46,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash 480798369, now seen corresponding path program 1 times [2018-12-02 04:40:46,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:46,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:46,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:46,310 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-02 04:40:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:46,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:46,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:46,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:46,312 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-02 04:40:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:46,435 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-02 04:40:46,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:46,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-02 04:40:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:46,435 INFO L225 Difference]: With dead ends: 366 [2018-12-02 04:40:46,435 INFO L226 Difference]: Without dead ends: 197 [2018-12-02 04:40:46,436 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-02 04:40:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-02 04:40:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-02 04:40:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-02 04:40:46,439 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 59 [2018-12-02 04:40:46,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:46,440 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-02 04:40:46,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-02 04:40:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 04:40:46,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:46,440 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] [2018-12-02 04:40:46,440 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:46,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1484856716, now seen corresponding path program 1 times [2018-12-02 04:40:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:46,477 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-02 04:40:46,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:46,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:46,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:46,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:46,477 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-02 04:40:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:46,659 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-02 04:40:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:46,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-02 04:40:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:46,660 INFO L225 Difference]: With dead ends: 383 [2018-12-02 04:40:46,660 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 04:40: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-02 04:40:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 04:40:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 04:40:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-02 04:40:46,664 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 71 [2018-12-02 04:40:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:46,665 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-02 04:40:46,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-02 04:40:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 04:40:46,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:46,665 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] [2018-12-02 04:40:46,665 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:46,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1155270063, now seen corresponding path program 1 times [2018-12-02 04:40:46,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:46,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:46,693 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-02 04:40:46,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:46,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:46,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:46,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:46,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:46,694 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-02 04:40:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:46,854 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-02 04:40:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:46,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 04:40:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:46,855 INFO L225 Difference]: With dead ends: 381 [2018-12-02 04:40:46,855 INFO L226 Difference]: Without dead ends: 212 [2018-12-02 04:40:46,856 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-02 04:40:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-02 04:40:46,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-02 04:40:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-02 04:40:46,860 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 72 [2018-12-02 04:40:46,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:46,860 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-02 04:40:46,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-02 04:40:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 04:40:46,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:46,860 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] [2018-12-02 04:40:46,861 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:46,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -488261392, now seen corresponding path program 1 times [2018-12-02 04:40:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:46,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:46,887 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-02 04:40:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:46,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:46,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:46,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:46,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:46,888 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-02 04:40:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:47,069 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-02 04:40:47,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:47,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 04:40:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:47,070 INFO L225 Difference]: With dead ends: 380 [2018-12-02 04:40:47,070 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 04:40:47,071 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-02 04:40:47,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 04:40:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 04:40:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-02 04:40:47,078 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 72 [2018-12-02 04:40:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:47,079 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-02 04:40:47,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-02 04:40:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-02 04:40:47,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:47,080 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] [2018-12-02 04:40:47,080 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:47,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2055209609, now seen corresponding path program 1 times [2018-12-02 04:40:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:47,126 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-02 04:40:47,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:47,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:47,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:47,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:47,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:47,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:47,127 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-02 04:40:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:47,307 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-02 04:40:47,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-02 04:40:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:47,308 INFO L225 Difference]: With dead ends: 380 [2018-12-02 04:40:47,308 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 04:40:47,309 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-02 04:40:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 04:40:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 04:40:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-02 04:40:47,315 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 73 [2018-12-02 04:40:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:47,315 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-02 04:40:47,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-02 04:40:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 04:40:47,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:47,316 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] [2018-12-02 04:40:47,316 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:47,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1083985708, now seen corresponding path program 1 times [2018-12-02 04:40:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:47,366 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-02 04:40:47,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:47,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:47,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:47,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:47,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:47,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:47,367 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-02 04:40:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:47,527 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-02 04:40:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:47,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-02 04:40:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:47,528 INFO L225 Difference]: With dead ends: 380 [2018-12-02 04:40:47,528 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 04:40:47,529 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-02 04:40:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 04:40:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 04:40:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-02 04:40:47,536 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 74 [2018-12-02 04:40:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:47,536 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-02 04:40:47,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-02 04:40:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 04:40:47,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:47,537 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] [2018-12-02 04:40:47,537 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:47,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash -241218748, now seen corresponding path program 1 times [2018-12-02 04:40:47,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:47,576 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-02 04:40:47,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:47,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:47,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:47,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:47,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:47,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:47,577 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-02 04:40:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:47,756 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-02 04:40:47,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:47,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2018-12-02 04:40:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:47,757 INFO L225 Difference]: With dead ends: 380 [2018-12-02 04:40:47,757 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 04:40:47,757 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-02 04:40:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 04:40:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 04:40:47,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-02 04:40:47,761 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 75 [2018-12-02 04:40:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:47,761 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-02 04:40:47,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-02 04:40:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 04:40:47,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:47,762 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] [2018-12-02 04:40:47,762 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash 345081479, now seen corresponding path program 1 times [2018-12-02 04:40:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:47,802 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-02 04:40:47,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:47,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:47,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:47,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:47,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:47,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:47,803 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-02 04:40:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:47,944 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-02 04:40:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:47,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2018-12-02 04:40:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:47,945 INFO L225 Difference]: With dead ends: 370 [2018-12-02 04:40:47,945 INFO L226 Difference]: Without dead ends: 201 [2018-12-02 04:40:47,945 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-02 04:40:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-02 04:40:47,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-02 04:40:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 04:40:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-02 04:40:47,949 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 76 [2018-12-02 04:40:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:47,949 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-02 04:40:47,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:47,949 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-02 04:40:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 04:40:47,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:47,950 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] [2018-12-02 04:40:47,950 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:47,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1440674399, now seen corresponding path program 1 times [2018-12-02 04:40:47,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:47,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:47,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:47,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:47,984 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-02 04:40:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:47,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:47,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:47,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:47,985 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-02 04:40:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:48,206 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-02 04:40:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:48,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 04:40:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:48,207 INFO L225 Difference]: With dead ends: 469 [2018-12-02 04:40:48,207 INFO L226 Difference]: Without dead ends: 300 [2018-12-02 04:40:48,208 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-02 04:40:48,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-02 04:40:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-12-02 04:40:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-12-02 04:40:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2018-12-02 04:40:48,213 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 80 [2018-12-02 04:40:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:48,213 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2018-12-02 04:40:48,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2018-12-02 04:40:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 04:40:48,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:48,214 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] [2018-12-02 04:40:48,214 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:48,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1368287841, now seen corresponding path program 1 times [2018-12-02 04:40:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:48,260 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-02 04:40:48,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:48,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:48,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:48,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:48,261 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand 4 states. [2018-12-02 04:40:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:48,459 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-12-02 04:40:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:48,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 04:40:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:48,461 INFO L225 Difference]: With dead ends: 472 [2018-12-02 04:40:48,461 INFO L226 Difference]: Without dead ends: 273 [2018-12-02 04:40:48,461 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-02 04:40:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-12-02 04:40:48,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 248. [2018-12-02 04:40:48,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-02 04:40:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 373 transitions. [2018-12-02 04:40:48,469 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 373 transitions. Word has length 80 [2018-12-02 04:40:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:48,469 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 373 transitions. [2018-12-02 04:40:48,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 373 transitions. [2018-12-02 04:40:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 04:40:48,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:48,470 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] [2018-12-02 04:40:48,470 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:48,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2002550352, now seen corresponding path program 1 times [2018-12-02 04:40:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:48,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:48,512 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-02 04:40:48,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:48,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:48,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:48,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:48,513 INFO L87 Difference]: Start difference. First operand 248 states and 373 transitions. Second operand 4 states. [2018-12-02 04:40:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:48,721 INFO L93 Difference]: Finished difference Result 539 states and 815 transitions. [2018-12-02 04:40:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:48,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 04:40:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:48,722 INFO L225 Difference]: With dead ends: 539 [2018-12-02 04:40:48,722 INFO L226 Difference]: Without dead ends: 316 [2018-12-02 04:40:48,722 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-02 04:40:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-02 04:40:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 249. [2018-12-02 04:40:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-02 04:40:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 374 transitions. [2018-12-02 04:40:48,731 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 374 transitions. Word has length 81 [2018-12-02 04:40:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:48,731 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 374 transitions. [2018-12-02 04:40:48,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 374 transitions. [2018-12-02 04:40:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 04:40:48,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:48,732 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] [2018-12-02 04:40:48,732 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:48,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash 323004382, now seen corresponding path program 1 times [2018-12-02 04:40:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:48,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:48,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:48,779 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-02 04:40:48,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:48,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:48,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:48,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:48,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:48,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:48,780 INFO L87 Difference]: Start difference. First operand 249 states and 374 transitions. Second operand 4 states. [2018-12-02 04:40:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:49,006 INFO L93 Difference]: Finished difference Result 540 states and 815 transitions. [2018-12-02 04:40:49,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:49,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 04:40:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:49,007 INFO L225 Difference]: With dead ends: 540 [2018-12-02 04:40:49,007 INFO L226 Difference]: Without dead ends: 316 [2018-12-02 04:40:49,008 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-02 04:40:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-02 04:40:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 259. [2018-12-02 04:40:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-02 04:40:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2018-12-02 04:40:49,014 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 87 [2018-12-02 04:40:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:49,014 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2018-12-02 04:40:49,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2018-12-02 04:40:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 04:40:49,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:49,015 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] [2018-12-02 04:40:49,015 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:49,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1206018514, now seen corresponding path program 1 times [2018-12-02 04:40:49,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:49,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:49,053 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-02 04:40:49,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:49,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:49,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:49,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:49,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:49,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:49,054 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2018-12-02 04:40:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:49,263 INFO L93 Difference]: Finished difference Result 542 states and 822 transitions. [2018-12-02 04:40:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:49,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 04:40:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:49,264 INFO L225 Difference]: With dead ends: 542 [2018-12-02 04:40:49,264 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 04:40:49,264 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-02 04:40:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 04:40:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-02 04:40:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-02 04:40:49,269 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 88 [2018-12-02 04:40:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:49,269 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-02 04:40:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-02 04:40:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 04:40:49,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:49,270 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] [2018-12-02 04:40:49,270 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:49,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash 62751798, now seen corresponding path program 1 times [2018-12-02 04:40:49,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:49,300 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-02 04:40:49,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:49,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:49,300 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:49,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:49,301 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-02 04:40:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:49,515 INFO L93 Difference]: Finished difference Result 543 states and 822 transitions. [2018-12-02 04:40:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:49,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-02 04:40:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:49,516 INFO L225 Difference]: With dead ends: 543 [2018-12-02 04:40:49,516 INFO L226 Difference]: Without dead ends: 308 [2018-12-02 04:40:49,517 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-02 04:40:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-02 04:40:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2018-12-02 04:40:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-02 04:40:49,523 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 93 [2018-12-02 04:40:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:49,523 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-02 04:40:49,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-02 04:40:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 04:40:49,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:49,524 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] [2018-12-02 04:40:49,524 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:49,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1991024500, now seen corresponding path program 1 times [2018-12-02 04:40:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:49,562 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-02 04:40:49,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:49,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:49,562 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:49,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:49,563 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-02 04:40:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:49,748 INFO L93 Difference]: Finished difference Result 520 states and 790 transitions. [2018-12-02 04:40:49,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:49,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-12-02 04:40:49,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:49,749 INFO L225 Difference]: With dead ends: 520 [2018-12-02 04:40:49,749 INFO L226 Difference]: Without dead ends: 285 [2018-12-02 04:40:49,750 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-02 04:40:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-02 04:40:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 260. [2018-12-02 04:40:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-02 04:40:49,758 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 93 [2018-12-02 04:40:49,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:49,759 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-02 04:40:49,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:49,759 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-02 04:40:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 04:40:49,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:49,760 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] [2018-12-02 04:40:49,760 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:49,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:49,760 INFO L82 PathProgramCache]: Analyzing trace with hash 19690565, now seen corresponding path program 1 times [2018-12-02 04:40:49,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:49,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:49,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:49,807 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-02 04:40:49,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:49,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:49,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:49,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:49,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:49,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:49,807 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-02 04:40:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:50,025 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2018-12-02 04:40:50,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:50,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 04:40:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:50,027 INFO L225 Difference]: With dead ends: 541 [2018-12-02 04:40:50,027 INFO L226 Difference]: Without dead ends: 306 [2018-12-02 04:40:50,028 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-02 04:40:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-02 04:40:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 260. [2018-12-02 04:40:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-02 04:40:50,040 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 94 [2018-12-02 04:40:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:50,040 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-02 04:40:50,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-02 04:40:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 04:40:50,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:50,043 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] [2018-12-02 04:40:50,043 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:50,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1623840890, now seen corresponding path program 1 times [2018-12-02 04:40:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:50,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:50,099 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-02 04:40:50,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:50,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:50,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:50,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:50,100 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-02 04:40:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:50,290 INFO L93 Difference]: Finished difference Result 540 states and 813 transitions. [2018-12-02 04:40:50,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:50,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 04:40:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:50,291 INFO L225 Difference]: With dead ends: 540 [2018-12-02 04:40:50,291 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 04:40:50,291 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-02 04:40:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 04:40:50,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-02 04:40:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:50,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-02 04:40:50,297 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 94 [2018-12-02 04:40:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:50,297 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-02 04:40:50,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-02 04:40:50,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 04:40:50,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:50,298 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] [2018-12-02 04:40:50,298 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:50,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:50,298 INFO L82 PathProgramCache]: Analyzing trace with hash -333397817, now seen corresponding path program 1 times [2018-12-02 04:40:50,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:50,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:50,332 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-02 04:40:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:50,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:50,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:50,333 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-02 04:40:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:50,511 INFO L93 Difference]: Finished difference Result 518 states and 782 transitions. [2018-12-02 04:40:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:50,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 04:40:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:50,512 INFO L225 Difference]: With dead ends: 518 [2018-12-02 04:40:50,512 INFO L226 Difference]: Without dead ends: 283 [2018-12-02 04:40:50,512 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-02 04:40:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-02 04:40:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2018-12-02 04:40:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-02 04:40:50,518 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 94 [2018-12-02 04:40:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:50,518 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-02 04:40:50,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-02 04:40:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 04:40:50,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:50,518 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] [2018-12-02 04:40:50,518 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1976929272, now seen corresponding path program 1 times [2018-12-02 04:40:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:50,547 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-02 04:40:50,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:50,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:50,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:50,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:50,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:50,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:50,548 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-02 04:40:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:50,695 INFO L93 Difference]: Finished difference Result 517 states and 779 transitions. [2018-12-02 04:40:50,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:50,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-02 04:40:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:50,696 INFO L225 Difference]: With dead ends: 517 [2018-12-02 04:40:50,696 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 04:40:50,697 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-02 04:40:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 04:40:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 04:40:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:50,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-02 04:40:50,704 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 94 [2018-12-02 04:40:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:50,705 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-02 04:40:50,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-02 04:40:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:40:50,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:50,705 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] [2018-12-02 04:40:50,705 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:50,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1211983539, now seen corresponding path program 1 times [2018-12-02 04:40:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:50,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:50,743 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-02 04:40:50,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:50,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:50,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:50,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:50,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:50,745 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-02 04:40:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:50,942 INFO L93 Difference]: Finished difference Result 540 states and 807 transitions. [2018-12-02 04:40:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:50,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-02 04:40:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:50,943 INFO L225 Difference]: With dead ends: 540 [2018-12-02 04:40:50,943 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 04:40:50,944 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-02 04:40:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 04:40:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-02 04:40:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-02 04:40:50,950 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 95 [2018-12-02 04:40:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:50,950 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-02 04:40:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-02 04:40:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 04:40:50,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:50,951 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] [2018-12-02 04:40:50,951 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:50,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:50,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1143821711, now seen corresponding path program 1 times [2018-12-02 04:40:50,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:50,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:50,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:50,975 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-02 04:40:50,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:50,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:50,975 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:50,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:50,976 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-02 04:40:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:51,144 INFO L93 Difference]: Finished difference Result 517 states and 775 transitions. [2018-12-02 04:40:51,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:51,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-02 04:40:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:51,145 INFO L225 Difference]: With dead ends: 517 [2018-12-02 04:40:51,145 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 04:40:51,145 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-02 04:40:51,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 04:40:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 04:40:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-02 04:40:51,151 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 95 [2018-12-02 04:40:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:51,151 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-02 04:40:51,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-02 04:40:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 04:40:51,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:51,152 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] [2018-12-02 04:40:51,152 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:51,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 713781314, now seen corresponding path program 1 times [2018-12-02 04:40:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:51,183 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-02 04:40:51,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:51,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:51,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:51,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:51,183 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-02 04:40:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:51,387 INFO L93 Difference]: Finished difference Result 540 states and 803 transitions. [2018-12-02 04:40:51,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:51,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 04:40:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:51,388 INFO L225 Difference]: With dead ends: 540 [2018-12-02 04:40:51,388 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 04:40:51,388 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-02 04:40:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 04:40:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-02 04:40:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-02 04:40:51,399 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 96 [2018-12-02 04:40:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:51,399 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-02 04:40:51,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-02 04:40:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 04:40:51,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:51,400 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] [2018-12-02 04:40:51,400 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:51,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 698262596, now seen corresponding path program 1 times [2018-12-02 04:40:51,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:51,453 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-02 04:40:51,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:51,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:51,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:51,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:51,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:51,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:51,454 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-02 04:40:51,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:51,618 INFO L93 Difference]: Finished difference Result 517 states and 771 transitions. [2018-12-02 04:40:51,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:51,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 04:40:51,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:51,619 INFO L225 Difference]: With dead ends: 517 [2018-12-02 04:40:51,619 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 04:40:51,620 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-02 04:40:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 04:40:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 04:40:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-02 04:40:51,626 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 96 [2018-12-02 04:40:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:51,626 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-02 04:40:51,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-02 04:40:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 04:40:51,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:51,627 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] [2018-12-02 04:40:51,627 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:51,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1167346926, now seen corresponding path program 1 times [2018-12-02 04:40:51,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:51,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:51,661 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-02 04:40:51,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:51,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:51,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:51,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:51,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:51,662 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-02 04:40:51,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:51,861 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2018-12-02 04:40:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:51,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-02 04:40:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:51,862 INFO L225 Difference]: With dead ends: 540 [2018-12-02 04:40:51,862 INFO L226 Difference]: Without dead ends: 305 [2018-12-02 04:40:51,862 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-02 04:40:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-02 04:40:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 260. [2018-12-02 04:40:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-02 04:40:51,869 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 97 [2018-12-02 04:40:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:51,869 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-02 04:40:51,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-02 04:40:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 04:40:51,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:51,870 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] [2018-12-02 04:40:51,870 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:51,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash 686266668, now seen corresponding path program 1 times [2018-12-02 04:40:51,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:51,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:51,901 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-02 04:40:51,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:51,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:51,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:51,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:51,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:51,902 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-02 04:40:52,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:52,046 INFO L93 Difference]: Finished difference Result 517 states and 767 transitions. [2018-12-02 04:40:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:52,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-02 04:40:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:52,047 INFO L225 Difference]: With dead ends: 517 [2018-12-02 04:40:52,047 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 04:40:52,047 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-02 04:40:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 04:40:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 04:40:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-02 04:40:52,055 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 97 [2018-12-02 04:40:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:52,055 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-02 04:40:52,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-02 04:40:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 04:40:52,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:52,056 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] [2018-12-02 04:40:52,056 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:52,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1060944413, now seen corresponding path program 1 times [2018-12-02 04:40:52,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:52,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:52,094 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-02 04:40:52,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:52,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:52,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:52,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:52,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:52,095 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-02 04:40:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:52,508 INFO L93 Difference]: Finished difference Result 530 states and 783 transitions. [2018-12-02 04:40:52,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:52,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 04:40:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:52,510 INFO L225 Difference]: With dead ends: 530 [2018-12-02 04:40:52,510 INFO L226 Difference]: Without dead ends: 295 [2018-12-02 04:40:52,511 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-02 04:40:52,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-02 04:40:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-02 04:40:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-02 04:40:52,536 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 98 [2018-12-02 04:40:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:52,536 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-02 04:40:52,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-02 04:40:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 04:40:52,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:52,538 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] [2018-12-02 04:40:52,538 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:52,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -967641697, now seen corresponding path program 1 times [2018-12-02 04:40:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:52,574 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-02 04:40:52,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:52,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:52,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:52,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:52,574 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-02 04:40:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:52,715 INFO L93 Difference]: Finished difference Result 507 states and 751 transitions. [2018-12-02 04:40:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:52,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 04:40:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:52,717 INFO L225 Difference]: With dead ends: 507 [2018-12-02 04:40:52,717 INFO L226 Difference]: Without dead ends: 272 [2018-12-02 04:40:52,717 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-02 04:40:52,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-02 04:40:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2018-12-02 04:40:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 380 transitions. [2018-12-02 04:40:52,723 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 380 transitions. Word has length 98 [2018-12-02 04:40:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:52,723 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 380 transitions. [2018-12-02 04:40:52,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:52,723 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 380 transitions. [2018-12-02 04:40:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 04:40:52,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:52,724 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] [2018-12-02 04:40:52,724 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:52,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1531434557, now seen corresponding path program 1 times [2018-12-02 04:40:52,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:52,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:52,767 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-02 04:40:52,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:52,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:52,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:52,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:52,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:52,768 INFO L87 Difference]: Start difference. First operand 260 states and 380 transitions. Second operand 4 states. [2018-12-02 04:40:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:52,960 INFO L93 Difference]: Finished difference Result 530 states and 779 transitions. [2018-12-02 04:40:52,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:52,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 04:40:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:52,962 INFO L225 Difference]: With dead ends: 530 [2018-12-02 04:40:52,962 INFO L226 Difference]: Without dead ends: 295 [2018-12-02 04:40:52,962 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-02 04:40:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-02 04:40:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 260. [2018-12-02 04:40:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 04:40:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 379 transitions. [2018-12-02 04:40:52,972 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 379 transitions. Word has length 102 [2018-12-02 04:40:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:52,972 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 379 transitions. [2018-12-02 04:40:52,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 379 transitions. [2018-12-02 04:40:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 04:40:52,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:52,973 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] [2018-12-02 04:40:52,974 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:52,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:52,974 INFO L82 PathProgramCache]: Analyzing trace with hash -144649147, now seen corresponding path program 1 times [2018-12-02 04:40:52,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:52,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:52,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:52,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:53,002 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-02 04:40:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:53,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:40:53,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:53,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:40:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:40:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:40:53,003 INFO L87 Difference]: Start difference. First operand 260 states and 379 transitions. Second operand 3 states. [2018-12-02 04:40:53,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:53,036 INFO L93 Difference]: Finished difference Result 728 states and 1080 transitions. [2018-12-02 04:40:53,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:40:53,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-02 04:40:53,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:53,038 INFO L225 Difference]: With dead ends: 728 [2018-12-02 04:40:53,038 INFO L226 Difference]: Without dead ends: 493 [2018-12-02 04:40:53,038 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-02 04:40:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-12-02 04:40:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2018-12-02 04:40:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-12-02 04:40:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 723 transitions. [2018-12-02 04:40:53,052 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 723 transitions. Word has length 102 [2018-12-02 04:40:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:53,052 INFO L480 AbstractCegarLoop]: Abstraction has 493 states and 723 transitions. [2018-12-02 04:40:53,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:40:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 723 transitions. [2018-12-02 04:40:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 04:40:53,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:53,053 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] [2018-12-02 04:40:53,053 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:53,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:53,053 INFO L82 PathProgramCache]: Analyzing trace with hash -282131921, now seen corresponding path program 1 times [2018-12-02 04:40:53,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:53,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:53,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 04:40:53,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:53,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:40:53,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:53,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:40:53,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:40:53,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:40:53,074 INFO L87 Difference]: Start difference. First operand 493 states and 723 transitions. Second operand 3 states. [2018-12-02 04:40:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:53,133 INFO L93 Difference]: Finished difference Result 1196 states and 1769 transitions. [2018-12-02 04:40:53,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:40:53,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-12-02 04:40:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:53,135 INFO L225 Difference]: With dead ends: 1196 [2018-12-02 04:40:53,135 INFO L226 Difference]: Without dead ends: 728 [2018-12-02 04:40:53,135 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-02 04:40:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-12-02 04:40:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 726. [2018-12-02 04:40:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-12-02 04:40:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1071 transitions. [2018-12-02 04:40:53,154 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1071 transitions. Word has length 104 [2018-12-02 04:40:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:53,154 INFO L480 AbstractCegarLoop]: Abstraction has 726 states and 1071 transitions. [2018-12-02 04:40:53,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:40:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1071 transitions. [2018-12-02 04:40:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-02 04:40:53,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:53,155 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] [2018-12-02 04:40:53,155 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:53,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:53,155 INFO L82 PathProgramCache]: Analyzing trace with hash -125424114, now seen corresponding path program 1 times [2018-12-02 04:40:53,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:53,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 04:40:53,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 04:40:53,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:53,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 04:40:53,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 04:40:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 04:40:53,184 INFO L87 Difference]: Start difference. First operand 726 states and 1071 transitions. Second operand 3 states. [2018-12-02 04:40:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:53,241 INFO L93 Difference]: Finished difference Result 1662 states and 2463 transitions. [2018-12-02 04:40:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 04:40:53,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-02 04:40:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:53,242 INFO L225 Difference]: With dead ends: 1662 [2018-12-02 04:40:53,243 INFO L226 Difference]: Without dead ends: 961 [2018-12-02 04:40:53,243 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-02 04:40:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-12-02 04:40:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2018-12-02 04:40:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2018-12-02 04:40:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1405 transitions. [2018-12-02 04:40:53,267 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1405 transitions. Word has length 111 [2018-12-02 04:40:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:53,267 INFO L480 AbstractCegarLoop]: Abstraction has 959 states and 1405 transitions. [2018-12-02 04:40:53,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 04:40:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1405 transitions. [2018-12-02 04:40:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 04:40:53,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:53,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 04:40:53,268 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:53,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1174112374, now seen corresponding path program 1 times [2018-12-02 04:40:53,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:53,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:53,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 04:40:53,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:53,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:53,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:53,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:53,304 INFO L87 Difference]: Start difference. First operand 959 states and 1405 transitions. Second operand 4 states. [2018-12-02 04:40:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:53,634 INFO L93 Difference]: Finished difference Result 2303 states and 3401 transitions. [2018-12-02 04:40:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:53,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-02 04:40:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:53,636 INFO L225 Difference]: With dead ends: 2303 [2018-12-02 04:40:53,636 INFO L226 Difference]: Without dead ends: 1369 [2018-12-02 04:40:53,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:40:53,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2018-12-02 04:40:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1115. [2018-12-02 04:40:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-12-02 04:40:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1689 transitions. [2018-12-02 04:40:53,664 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1689 transitions. Word has length 128 [2018-12-02 04:40:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:53,664 INFO L480 AbstractCegarLoop]: Abstraction has 1115 states and 1689 transitions. [2018-12-02 04:40:53,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1689 transitions. [2018-12-02 04:40:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 04:40:53,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:53,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 04:40:53,665 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:53,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:53,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2040039334, now seen corresponding path program 1 times [2018-12-02 04:40:53,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:53,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 04:40:53,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:53,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 04:40:53,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:53,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 04:40:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 04:40:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 04:40:53,701 INFO L87 Difference]: Start difference. First operand 1115 states and 1689 transitions. Second operand 4 states. [2018-12-02 04:40:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:53,984 INFO L93 Difference]: Finished difference Result 2433 states and 3649 transitions. [2018-12-02 04:40:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 04:40:53,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-02 04:40:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:53,987 INFO L225 Difference]: With dead ends: 2433 [2018-12-02 04:40:53,987 INFO L226 Difference]: Without dead ends: 1343 [2018-12-02 04:40:53,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 04:40:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-12-02 04:40:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1075. [2018-12-02 04:40:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-12-02 04:40:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1613 transitions. [2018-12-02 04:40:54,017 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1613 transitions. Word has length 129 [2018-12-02 04:40:54,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:54,017 INFO L480 AbstractCegarLoop]: Abstraction has 1075 states and 1613 transitions. [2018-12-02 04:40:54,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 04:40:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1613 transitions. [2018-12-02 04:40:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 04:40:54,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:54,018 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:40:54,018 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:54,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:54,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2028637021, now seen corresponding path program 1 times [2018-12-02 04:40:54,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:54,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:54,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:54,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 04:40:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 04:40:54,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 04:40:54,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 04:40:54,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 04:40:54,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 04:40:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 04:40:54,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 04:40:54,187 INFO L87 Difference]: Start difference. First operand 1075 states and 1613 transitions. Second operand 7 states. [2018-12-02 04:40:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 04:40:54,955 INFO L93 Difference]: Finished difference Result 3503 states and 5230 transitions. [2018-12-02 04:40:54,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 04:40:54,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-12-02 04:40:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 04:40:54,960 INFO L225 Difference]: With dead ends: 3503 [2018-12-02 04:40:54,960 INFO L226 Difference]: Without dead ends: 2453 [2018-12-02 04:40:54,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 04:40:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2018-12-02 04:40:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1705. [2018-12-02 04:40:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2018-12-02 04:40:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2556 transitions. [2018-12-02 04:40:55,027 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2556 transitions. Word has length 133 [2018-12-02 04:40:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 04:40:55,027 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 2556 transitions. [2018-12-02 04:40:55,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 04:40:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2556 transitions. [2018-12-02 04:40:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-02 04:40:55,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 04:40:55,029 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 04:40:55,029 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 04:40:55,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 04:40:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1236970977, now seen corresponding path program 1 times [2018-12-02 04:40:55,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 04:40:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:55,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 04:40:55,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 04:40:55,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 04:40:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:40:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 04:40:55,153 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 04:40:55,184 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-02 04:40:55,184 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 24608 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-02 04:40:55,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 04:40:55 BoogieIcfgContainer [2018-12-02 04:40:55,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 04:40:55,219 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 04:40:55,219 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 04:40:55,219 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 04:40:55,220 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 04:40:43" (3/4) ... [2018-12-02 04:40:55,222 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 04:40:55,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 04:40:55,223 INFO L168 Benchmark]: Toolchain (without parser) took 12430.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -297.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:55,223 INFO L168 Benchmark]: CDTParser took 0.17 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-02 04:40:55,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:55,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.71 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-02 04:40:55,224 INFO L168 Benchmark]: Boogie Preprocessor took 47.78 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:55,224 INFO L168 Benchmark]: RCFGBuilder took 605.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:55,224 INFO L168 Benchmark]: TraceAbstraction took 11370.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 994.6 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 04:40:55,225 INFO L168 Benchmark]: Witness Printer took 2.82 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-02 04:40:55,226 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.71 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 47.78 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 605.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.6 MB in the end (delta: 86.9 MB). Peak memory consumption was 86.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11370.28 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 208.7 MB). Free memory was 994.6 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.82 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 24608 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: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1444. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=24620, \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)) VAL [init=1, malloc(sizeof(SSL))={24590:0}, malloc(sizeof(SSL_CTX))={24621:0}, malloc(sizeof(SSL_SESSION))={24579:0}, malloc(sizeof(struct ssl3_state_st))={24616:0}, s={24590:0}, SSLv3_server_data={24587:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={24590:0}, SSLv3_server_data={24587:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [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={24590:0}, s={24590:0}, s->info_callback={2:-1}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={24590:0}, s={24590:0}, s->state=8464, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8464, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=1, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8496, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->hit=0, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8496, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [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={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8512, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24606, (s->s3)->tmp.new_cipher={24601:0}, blastFlag=2, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 6 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1370] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1376] s->state = 8528 [L1377] s->init_num = 0 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8512, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, ret=1, s={24590:0}, s={24590:0}, s->state=8528, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options VAL [={2:-1}, blastFlag=6, got_new_session=1, init=1, l=24606, ret=1, s={24590:0}, s={24590:0}, s->options=24610, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp VAL [={2:-1}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=6, got_new_session=1, init=1, l=24606, ret=1, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 6 [L1407] blastFlag = 7 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1411] COND FALSE !(ret <= 0) VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1428] s->state = 8544 [L1429] s->init_num = 0 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [={2:-1}, (s->s3)->tmp.reuse_message=24602, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8528, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->state=8544, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->verify_mode=24580, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer VAL [={2:-1}, (s->session)->peer={0:0}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->session={24579:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={2:-1}, ((s->s3)->tmp.new_cipher)->algorithms=24606, (s->s3)->tmp.new_cipher={24601:0}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=7, s={24590:0}, s={24590:0}, s->s3={24616:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 7 VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=0, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1726] __VERIFIER_error() VAL [={2:-1}, blastFlag=7, got_new_session=1, init=1, l=24606, ret=0, s={24590:0}, s={24590:0}, skip=0, SSLv3_server_data={24587:0}, state=8544, Time=0, tmp=0, tmp___1=0, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 11.3s OverallTime, 44 OverallIterations, 5 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9144 SDtfs, 2959 SDslu, 13377 SDs, 0 SdLazy, 8422 SolverSat, 454 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 88 SyntacticMatches, 77 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1705occurred in iteration=43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 43 MinimizatonAttempts, 2276 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3753 NumberOfCodeBlocks, 3753 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3577 ConstructedInterpolants, 0 QuantifiedInterpolants, 1033875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 2080/2080 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-02 04:40:56,532 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 04:40:56,533 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 04:40:56,539 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 04:40:56,539 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 04:40:56,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 04:40:56,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 04:40:56,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 04:40:56,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 04:40:56,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 04:40:56,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 04:40:56,543 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 04:40:56,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 04:40:56,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 04:40:56,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 04:40:56,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 04:40:56,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 04:40:56,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 04:40:56,546 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 04:40:56,547 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 04:40:56,548 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 04:40:56,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 04:40:56,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 04:40:56,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 04:40:56,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 04:40:56,550 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 04:40:56,551 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 04:40:56,551 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 04:40:56,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 04:40:56,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 04:40:56,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 04:40:56,552 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 04:40:56,552 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 04:40:56,553 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 04:40:56,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 04:40:56,553 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 04:40:56,553 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 04:40:56,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 04:40:56,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 04:40:56,561 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 04:40:56,562 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 04:40:56,562 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 04:40:56,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 04:40:56,563 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 04:40:56,564 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 04:40:56,564 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 04:40:56,564 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 04:40:56,565 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 04:40:56,565 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 04:40:56,565 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 04:40:56,565 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 04:40:56,565 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_26fea782-937f-4201-a634-0fb61c17ae6b/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 -> 0d6ad3f0294acf0e7c3fc00758f9075ea20494f3 [2018-12-02 04:40:56,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 04:40:56,592 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 04:40:56,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 04:40:56,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 04:40:56,597 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 04:40:56,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-02 04:40:56,633 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/dcb45b472/1cb37cdca35c4b2fb3cd64b771af9abd/FLAG22b603610 [2018-12-02 04:40:57,043 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 04:40:57,044 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/sv-benchmarks/c/ssh/s3_srvr.blast.11_false-unreach-call.i.cil.c [2018-12-02 04:40:57,053 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/dcb45b472/1cb37cdca35c4b2fb3cd64b771af9abd/FLAG22b603610 [2018-12-02 04:40:57,389 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_26fea782-937f-4201-a634-0fb61c17ae6b/bin-2019/utaipan/data/dcb45b472/1cb37cdca35c4b2fb3cd64b771af9abd [2018-12-02 04:40:57,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 04:40:57,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 04:40:57,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 04:40:57,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 04:40:57,405 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 04:40:57,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:40:57" (1/1) ... [2018-12-02 04:40:57,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c368c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 04:40:57, skipping insertion in model container [2018-12-02 04:40:57,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 04:40:57" (1/1) ... [2018-12-02 04:40:57,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 04:40:57,441 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 04:40:57,651 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:40:57,664 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 04:40:57,774 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 04:40:57,774 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-02 04:40:57,777 INFO L168 Benchmark]: Toolchain (without parser) took 381.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:57,778 INFO L168 Benchmark]: CDTParser took 0.16 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-02 04:40:57,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-02 04:40:57,779 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -182.9 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...