./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/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 429b7772bb057004ca0c11ab7cd7751d4a0d846f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:39:10,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:39:10,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:39:10,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:39:10,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:39:10,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:39:10,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:39:10,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:39:10,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:39:10,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:39:10,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:39:10,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:39:10,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:39:10,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:39:10,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:39:10,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:39:10,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:39:10,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:39:10,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:39:10,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:39:10,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:39:10,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:39:10,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:39:10,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:39:10,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:39:10,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:39:10,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:39:10,285 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:39:10,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:39:10,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:39:10,287 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:39:10,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:39:10,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:39:10,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:39:10,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:39:10,289 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:39:10,289 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 09:39:10,299 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:39:10,299 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:39:10,300 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:39:10,300 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:39:10,300 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 09:39:10,300 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 09:39:10,300 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 09:39:10,300 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 09:39:10,301 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 09:39:10,301 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 09:39:10,301 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 09:39:10,301 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 09:39:10,301 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 09:39:10,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:39:10,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:39:10,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:39:10,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:39:10,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:39:10,304 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 09:39:10,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:39:10,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:39:10,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:39:10,305 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_e30093f7-db11-4623-8cf9-d7dcc971545e/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 -> 429b7772bb057004ca0c11ab7cd7751d4a0d846f [2018-11-23 09:39:10,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:39:10,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:39:10,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:39:10,339 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:39:10,339 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:39:10,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-23 09:39:10,374 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/data/d1c4ddd49/059804c211934d76a2a0223024b018ac/FLAG749b84873 [2018-11-23 09:39:10,774 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:39:10,774 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/sv-benchmarks/c/ssh-simplified/s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-23 09:39:10,780 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/data/d1c4ddd49/059804c211934d76a2a0223024b018ac/FLAG749b84873 [2018-11-23 09:39:10,794 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/data/d1c4ddd49/059804c211934d76a2a0223024b018ac [2018-11-23 09:39:10,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:39:10,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:39:10,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:39:10,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:39:10,801 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:39:10,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:10" (1/1) ... [2018-11-23 09:39:10,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16069910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:10, skipping insertion in model container [2018-11-23 09:39:10,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:39:10" (1/1) ... [2018-11-23 09:39:10,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:39:10,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:39:10,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:39:10,982 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:39:11,024 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:39:11,032 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:39:11,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11 WrapperNode [2018-11-23 09:39:11,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:39:11,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:39:11,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:39:11,033 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:39:11,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:39:11,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:39:11,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:39:11,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:39:11,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... [2018-11-23 09:39:11,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:39:11,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:39:11,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:39:11,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:39:11,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/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-11-23 09:39:11,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-23 09:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-23 09:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:39:11,172 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:39:11,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:39:11,266 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 09:39:11,266 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 09:39:11,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:39:11,581 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 09:39:11,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:11 BoogieIcfgContainer [2018-11-23 09:39:11,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:39:11,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:39:11,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:39:11,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:39:11,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:39:10" (1/3) ... [2018-11-23 09:39:11,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73ec20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:11, skipping insertion in model container [2018-11-23 09:39:11,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:39:11" (2/3) ... [2018-11-23 09:39:11,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e73ec20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:39:11, skipping insertion in model container [2018-11-23 09:39:11,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:11" (3/3) ... [2018-11-23 09:39:11,587 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3_true-unreach-call_true-termination.cil.c [2018-11-23 09:39:11,595 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:39:11,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:39:11,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:39:11,642 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:39:11,642 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:39:11,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:39:11,643 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:39:11,643 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:39:11,643 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:39:11,643 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:39:11,643 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:39:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-23 09:39:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:39:11,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:11,666 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] [2018-11-23 09:39:11,668 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:11,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:11,673 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-23 09:39:11,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:11,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:11,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:11,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:11,832 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:11,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:11,849 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-23 09:39:11,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:11,918 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-23 09:39:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:11,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 09:39:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:11,928 INFO L225 Difference]: With dead ends: 377 [2018-11-23 09:39:11,928 INFO L226 Difference]: Without dead ends: 220 [2018-11-23 09:39:11,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-23 09:39:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-23 09:39:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-23 09:39:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-23 09:39:11,972 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-23 09:39:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:11,973 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-23 09:39:11,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-23 09:39:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 09:39:11,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:11,975 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] [2018-11-23 09:39:11,975 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:11,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2018-11-23 09:39:11,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:11,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:11,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:39:12,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:12,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:12,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,032 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-23 09:39:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:12,170 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2018-11-23 09:39:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:12,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-23 09:39:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:12,173 INFO L225 Difference]: With dead ends: 472 [2018-11-23 09:39:12,173 INFO L226 Difference]: Without dead ends: 264 [2018-11-23 09:39:12,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-23 09:39:12,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-11-23 09:39:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-23 09:39:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-23 09:39:12,191 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-23 09:39:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:12,191 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-23 09:39:12,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-23 09:39:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 09:39:12,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:12,194 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 09:39:12,194 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:12,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2018-11-23 09:39:12,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:12,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:12,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 09:39:12,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:12,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:12,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,274 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-23 09:39:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:12,431 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-23 09:39:12,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:12,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-23 09:39:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:12,433 INFO L225 Difference]: With dead ends: 598 [2018-11-23 09:39:12,433 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 09:39:12,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 09:39:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-23 09:39:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-23 09:39:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-23 09:39:12,448 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-23 09:39:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:12,448 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-23 09:39:12,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-23 09:39:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 09:39:12,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:12,451 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 09:39:12,452 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:12,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2018-11-23 09:39:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 09:39:12,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:12,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:12,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:12,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,504 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-23 09:39:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:12,604 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-11-23 09:39:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:12,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-23 09:39:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:12,606 INFO L225 Difference]: With dead ends: 708 [2018-11-23 09:39:12,606 INFO L226 Difference]: Without dead ends: 384 [2018-11-23 09:39:12,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-23 09:39:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-23 09:39:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-23 09:39:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-23 09:39:12,619 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-23 09:39:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:12,619 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-23 09:39:12,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-23 09:39:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 09:39:12,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:12,621 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:12,621 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:12,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:12,621 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2018-11-23 09:39:12,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:12,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 09:39:12,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:12,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:12,681 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:12,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,682 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-23 09:39:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:12,805 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-23 09:39:12,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:12,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-23 09:39:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:12,807 INFO L225 Difference]: With dead ends: 842 [2018-11-23 09:39:12,808 INFO L226 Difference]: Without dead ends: 478 [2018-11-23 09:39:12,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-23 09:39:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-23 09:39:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-23 09:39:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-23 09:39:12,823 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-23 09:39:12,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:12,824 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-23 09:39:12,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-23 09:39:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 09:39:12,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:12,825 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:12,826 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:12,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2018-11-23 09:39:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 09:39:12,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:12,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:12,872 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:12,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:12,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,873 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-23 09:39:12,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:12,955 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-23 09:39:12,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:12,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-23 09:39:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:12,958 INFO L225 Difference]: With dead ends: 940 [2018-11-23 09:39:12,958 INFO L226 Difference]: Without dead ends: 500 [2018-11-23 09:39:12,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-23 09:39:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-23 09:39:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-23 09:39:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-23 09:39:12,976 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-23 09:39:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:12,977 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-23 09:39:12,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-23 09:39:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 09:39:12,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:12,979 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:12,979 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:12,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2018-11-23 09:39:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:12,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:12,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 09:39:13,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,030 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-23 09:39:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:13,078 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-23 09:39:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:13,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-23 09:39:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:13,080 INFO L225 Difference]: With dead ends: 976 [2018-11-23 09:39:13,080 INFO L226 Difference]: Without dead ends: 734 [2018-11-23 09:39:13,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-23 09:39:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-23 09:39:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-23 09:39:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-23 09:39:13,098 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-23 09:39:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:13,098 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-23 09:39:13,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-23 09:39:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 09:39:13,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:13,100 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:13,100 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:13,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:13,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2018-11-23 09:39:13,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:13,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:13,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-23 09:39:13,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,154 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-23 09:39:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:13,192 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-23 09:39:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:13,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-23 09:39:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:13,196 INFO L225 Difference]: With dead ends: 976 [2018-11-23 09:39:13,196 INFO L226 Difference]: Without dead ends: 974 [2018-11-23 09:39:13,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-23 09:39:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-23 09:39:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-23 09:39:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-23 09:39:13,218 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-23 09:39:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:13,219 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-23 09:39:13,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-23 09:39:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-23 09:39:13,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:13,221 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:13,221 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:13,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:13,221 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2018-11-23 09:39:13,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:13,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-23 09:39:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,263 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-23 09:39:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:13,385 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-23 09:39:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:13,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-11-23 09:39:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:13,389 INFO L225 Difference]: With dead ends: 2140 [2018-11-23 09:39:13,389 INFO L226 Difference]: Without dead ends: 1170 [2018-11-23 09:39:13,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-23 09:39:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-23 09:39:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-23 09:39:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-23 09:39:13,416 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2018-11-23 09:39:13,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:13,417 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-23 09:39:13,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:13,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-23 09:39:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-23 09:39:13,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:13,420 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:13,420 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:13,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2018-11-23 09:39:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,464 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-23 09:39:13,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,466 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-23 09:39:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:13,556 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-23 09:39:13,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:13,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-23 09:39:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:13,562 INFO L225 Difference]: With dead ends: 2354 [2018-11-23 09:39:13,562 INFO L226 Difference]: Without dead ends: 1236 [2018-11-23 09:39:13,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-23 09:39:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-23 09:39:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-23 09:39:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-23 09:39:13,589 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2018-11-23 09:39:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:13,590 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-23 09:39:13,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-23 09:39:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-23 09:39:13,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:13,593 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:13,593 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:13,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2018-11-23 09:39:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:13,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,660 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 09:39:13,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,661 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,662 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-23 09:39:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:13,764 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-23 09:39:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:13,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-11-23 09:39:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:13,769 INFO L225 Difference]: With dead ends: 2544 [2018-11-23 09:39:13,769 INFO L226 Difference]: Without dead ends: 1334 [2018-11-23 09:39:13,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-23 09:39:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-23 09:39:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-23 09:39:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-23 09:39:13,800 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2018-11-23 09:39:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:13,801 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-23 09:39:13,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-23 09:39:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-23 09:39:13,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:13,805 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:13,806 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:13,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2018-11-23 09:39:13,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:13,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:13,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 09:39:13,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:13,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:13,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:13,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:13,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:13,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:13,919 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-23 09:39:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:14,021 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-23 09:39:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-23 09:39:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:14,026 INFO L225 Difference]: With dead ends: 2752 [2018-11-23 09:39:14,026 INFO L226 Difference]: Without dead ends: 1442 [2018-11-23 09:39:14,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-23 09:39:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-23 09:39:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-23 09:39:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-23 09:39:14,057 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2018-11-23 09:39:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:14,057 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-23 09:39:14,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-23 09:39:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-23 09:39:14,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:14,061 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:14,061 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:14,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2018-11-23 09:39:14,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:14,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-23 09:39:14,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:14,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:14,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:14,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:14,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,116 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-23 09:39:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:14,219 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-23 09:39:14,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:14,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-23 09:39:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:14,223 INFO L225 Difference]: With dead ends: 2992 [2018-11-23 09:39:14,223 INFO L226 Difference]: Without dead ends: 1570 [2018-11-23 09:39:14,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-23 09:39:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-23 09:39:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-23 09:39:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-23 09:39:14,244 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2018-11-23 09:39:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:14,245 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-23 09:39:14,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-23 09:39:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-23 09:39:14,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:14,248 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:14,248 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:14,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2018-11-23 09:39:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-11-23 09:39:14,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:14,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:14,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:14,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,302 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-23 09:39:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:14,336 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-23 09:39:14,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:14,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-11-23 09:39:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:14,342 INFO L225 Difference]: With dead ends: 4646 [2018-11-23 09:39:14,342 INFO L226 Difference]: Without dead ends: 3100 [2018-11-23 09:39:14,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-23 09:39:14,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-23 09:39:14,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-23 09:39:14,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-23 09:39:14,382 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2018-11-23 09:39:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:14,382 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-23 09:39:14,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-23 09:39:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-23 09:39:14,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:14,386 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:14,387 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:14,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2018-11-23 09:39:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:14,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-11-23 09:39:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:14,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:14,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,445 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-23 09:39:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:14,566 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-23 09:39:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:14,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2018-11-23 09:39:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:14,572 INFO L225 Difference]: With dead ends: 6484 [2018-11-23 09:39:14,572 INFO L226 Difference]: Without dead ends: 3398 [2018-11-23 09:39:14,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-23 09:39:14,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-23 09:39:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-23 09:39:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-23 09:39:14,625 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2018-11-23 09:39:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:14,625 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-23 09:39:14,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-23 09:39:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-23 09:39:14,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:14,631 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:14,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:14,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2018-11-23 09:39:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2018-11-23 09:39:14,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:14,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:14,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:14,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,704 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-23 09:39:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:14,810 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-23 09:39:14,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:14,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-11-23 09:39:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:14,816 INFO L225 Difference]: With dead ends: 6900 [2018-11-23 09:39:14,816 INFO L226 Difference]: Without dead ends: 3530 [2018-11-23 09:39:14,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-23 09:39:14,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-23 09:39:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-23 09:39:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-23 09:39:14,857 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2018-11-23 09:39:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:14,857 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-23 09:39:14,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-23 09:39:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-11-23 09:39:14,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:14,862 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:14,862 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:14,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:14,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2018-11-23 09:39:14,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:14,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:14,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:14,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 09:39:14,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:14,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:14,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:14,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:14,920 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-23 09:39:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:15,039 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-23 09:39:15,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:15,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2018-11-23 09:39:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:15,046 INFO L225 Difference]: With dead ends: 7416 [2018-11-23 09:39:15,046 INFO L226 Difference]: Without dead ends: 3914 [2018-11-23 09:39:15,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-23 09:39:15,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-23 09:39:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-23 09:39:15,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-23 09:39:15,091 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2018-11-23 09:39:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:15,091 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-23 09:39:15,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-23 09:39:15,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-23 09:39:15,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:15,095 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:15,095 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:15,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2018-11-23 09:39:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:15,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-23 09:39:15,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:15,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:15,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:15,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:15,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:15,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,176 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-23 09:39:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:15,304 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-23 09:39:15,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:15,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-23 09:39:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:15,315 INFO L225 Difference]: With dead ends: 8048 [2018-11-23 09:39:15,315 INFO L226 Difference]: Without dead ends: 4234 [2018-11-23 09:39:15,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-23 09:39:15,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-23 09:39:15,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-23 09:39:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-23 09:39:15,364 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2018-11-23 09:39:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:15,364 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-23 09:39:15,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-23 09:39:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-11-23 09:39:15,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:15,368 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:15,368 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:15,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2018-11-23 09:39:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-11-23 09:39:15,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:15,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:15,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:15,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:15,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:15,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,445 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-23 09:39:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:15,509 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-23 09:39:15,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:15,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2018-11-23 09:39:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:15,521 INFO L225 Difference]: With dead ends: 11310 [2018-11-23 09:39:15,521 INFO L226 Difference]: Without dead ends: 7376 [2018-11-23 09:39:15,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-23 09:39:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-23 09:39:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-23 09:39:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-23 09:39:15,601 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2018-11-23 09:39:15,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:15,601 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-23 09:39:15,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-23 09:39:15,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-11-23 09:39:15,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:15,606 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:15,607 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:15,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2018-11-23 09:39:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:15,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-23 09:39:15,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:15,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:15,671 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:15,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,672 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-23 09:39:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:15,816 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-23 09:39:15,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:15,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2018-11-23 09:39:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:15,825 INFO L225 Difference]: With dead ends: 14744 [2018-11-23 09:39:15,825 INFO L226 Difference]: Without dead ends: 7382 [2018-11-23 09:39:15,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-23 09:39:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-23 09:39:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-23 09:39:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-23 09:39:15,937 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2018-11-23 09:39:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:15,937 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-23 09:39:15,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-23 09:39:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-23 09:39:15,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:15,971 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:15,971 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:15,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2018-11-23 09:39:15,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:15,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:15,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:16,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-11-23 09:39:16,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:16,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:16,040 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-23 09:39:16,041 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-23 09:39:16,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 09:39:16,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 09:39:16,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 09:39:16,521 INFO L272 AbstractInterpreter]: Visited 102 different actions 310 times. Merged at 84 different actions 180 times. Widened at 1 different actions 1 times. Performed 1641 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1641 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 16 different actions. Largest state had 114 variables. [2018-11-23 09:39:16,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:16,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 09:39:16,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:16,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:16,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:16,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 09:39:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:16,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-11-23 09:39:16,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2018-11-23 09:39:16,810 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 09:39:16,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-11-23 09:39:16,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:16,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 09:39:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 09:39:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 09:39:16,812 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2018-11-23 09:39:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:17,119 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2018-11-23 09:39:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:39:17,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2018-11-23 09:39:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:17,131 INFO L225 Difference]: With dead ends: 14866 [2018-11-23 09:39:17,131 INFO L226 Difference]: Without dead ends: 7500 [2018-11-23 09:39:17,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 09:39:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2018-11-23 09:39:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2018-11-23 09:39:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2018-11-23 09:39:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2018-11-23 09:39:17,299 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 339 [2018-11-23 09:39:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:17,299 INFO L480 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2018-11-23 09:39:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 09:39:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2018-11-23 09:39:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-11-23 09:39:17,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:17,307 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:17,308 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:17,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 998396082, now seen corresponding path program 1 times [2018-11-23 09:39:17,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:17,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:17,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:17,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-11-23 09:39:17,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:17,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:17,421 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-11-23 09:39:17,421 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-23 09:39:17,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 09:39:17,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 09:39:17,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 09:39:17,842 INFO L272 AbstractInterpreter]: Visited 111 different actions 332 times. Merged at 92 different actions 190 times. Widened at 1 different actions 1 times. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 40 fixpoints after 17 different actions. Largest state had 116 variables. [2018-11-23 09:39:17,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:17,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 09:39:17,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:17,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:17,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:17,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 09:39:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:17,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-11-23 09:39:18,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2018-11-23 09:39:18,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 09:39:18,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 09:39:18,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 09:39:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:39:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:39:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:39:18,186 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2018-11-23 09:39:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:18,435 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2018-11-23 09:39:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:39:18,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-11-23 09:39:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:18,446 INFO L225 Difference]: With dead ends: 14624 [2018-11-23 09:39:18,446 INFO L226 Difference]: Without dead ends: 11034 [2018-11-23 09:39:18,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:39:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-23 09:39:18,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-23 09:39:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-23 09:39:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-23 09:39:18,551 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 352 [2018-11-23 09:39:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:18,552 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-23 09:39:18,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:39:18,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-23 09:39:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-11-23 09:39:18,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:18,558 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:18,558 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:18,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:18,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 2 times [2018-11-23 09:39:18,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:18,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:18,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:18,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:18,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-23 09:39:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:18,636 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 09:39:18,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 09:39:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:18,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 09:39:18,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 09:39:18,692 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 09:39:18,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:39:18,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-23 09:39:18,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-11-23 09:39:18,796 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 09:39:18,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 09:39:18,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:18,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:39:18,797 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2018-11-23 09:39:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:18,929 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2018-11-23 09:39:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:18,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-11-23 09:39:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:18,937 INFO L225 Difference]: With dead ends: 16374 [2018-11-23 09:39:18,937 INFO L226 Difference]: Without dead ends: 7932 [2018-11-23 09:39:18,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:39:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2018-11-23 09:39:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2018-11-23 09:39:19,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2018-11-23 09:39:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2018-11-23 09:39:19,075 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 365 [2018-11-23 09:39:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:19,075 INFO L480 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2018-11-23 09:39:19,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2018-11-23 09:39:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-23 09:39:19,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:19,083 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:19,083 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:19,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:19,083 INFO L82 PathProgramCache]: Analyzing trace with hash 776946245, now seen corresponding path program 1 times [2018-11-23 09:39:19,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:19,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:39:19,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:19,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-23 09:39:19,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:19,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:19,206 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2018-11-23 09:39:19,206 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [272], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-23 09:39:19,209 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 09:39:19,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 09:39:19,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 09:39:19,626 INFO L272 AbstractInterpreter]: Visited 112 different actions 341 times. Merged at 95 different actions 196 times. Widened at 3 different actions 3 times. Performed 1834 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1834 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 42 fixpoints after 19 different actions. Largest state had 116 variables. [2018-11-23 09:39:19,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:19,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 09:39:19,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:19,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:19,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 09:39:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:19,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-23 09:39:19,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-23 09:39:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 09:39:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 09:39:19,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 09:39:19,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:39:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:39:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:39:19,909 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 4 states. [2018-11-23 09:39:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:20,215 INFO L93 Difference]: Finished difference Result 17152 states and 21441 transitions. [2018-11-23 09:39:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:39:20,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-11-23 09:39:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:20,232 INFO L225 Difference]: With dead ends: 17152 [2018-11-23 09:39:20,232 INFO L226 Difference]: Without dead ends: 9478 [2018-11-23 09:39:20,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:39:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2018-11-23 09:39:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7985. [2018-11-23 09:39:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2018-11-23 09:39:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2018-11-23 09:39:20,409 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 379 [2018-11-23 09:39:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:20,410 INFO L480 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2018-11-23 09:39:20,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:39:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2018-11-23 09:39:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-23 09:39:20,419 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:20,419 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:20,420 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:20,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:20,420 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2018-11-23 09:39:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:20,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:20,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-23 09:39:20,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:39:20,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:39:20,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:20,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:20,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:20,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:20,594 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2018-11-23 09:39:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:20,831 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2018-11-23 09:39:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:20,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-11-23 09:39:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:20,839 INFO L225 Difference]: With dead ends: 15351 [2018-11-23 09:39:20,839 INFO L226 Difference]: Without dead ends: 3759 [2018-11-23 09:39:20,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:39:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2018-11-23 09:39:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2018-11-23 09:39:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2018-11-23 09:39:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2018-11-23 09:39:20,899 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2018-11-23 09:39:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2018-11-23 09:39:20,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2018-11-23 09:39:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-11-23 09:39:20,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:20,904 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:20,904 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:20,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2018-11-23 09:39:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:20,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:20,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:20,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2018-11-23 09:39:21,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:21,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:21,067 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 503 with the following transitions: [2018-11-23 09:39:21,067 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [283], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-23 09:39:21,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 09:39:21,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 09:39:21,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 09:39:21,519 INFO L272 AbstractInterpreter]: Visited 118 different actions 420 times. Merged at 95 different actions 254 times. Widened at 2 different actions 2 times. Performed 2141 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2141 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 57 fixpoints after 33 different actions. Largest state had 117 variables. [2018-11-23 09:39:21,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:21,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 09:39:21,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:21,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:21,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:21,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 09:39:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:21,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-11-23 09:39:21,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2018-11-23 09:39:21,967 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 09:39:21,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-23 09:39:21,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 09:39:21,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:39:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:39:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:39:21,968 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 3 states. [2018-11-23 09:39:22,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:22,002 INFO L93 Difference]: Finished difference Result 3600 states and 4449 transitions. [2018-11-23 09:39:22,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:39:22,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2018-11-23 09:39:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:22,009 INFO L225 Difference]: With dead ends: 3600 [2018-11-23 09:39:22,009 INFO L226 Difference]: Without dead ends: 3523 [2018-11-23 09:39:22,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1007 GetRequests, 1004 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:39:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2018-11-23 09:39:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3449. [2018-11-23 09:39:22,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2018-11-23 09:39:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4260 transitions. [2018-11-23 09:39:22,057 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4260 transitions. Word has length 502 [2018-11-23 09:39:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:22,057 INFO L480 AbstractCegarLoop]: Abstraction has 3449 states and 4260 transitions. [2018-11-23 09:39:22,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:39:22,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4260 transitions. [2018-11-23 09:39:22,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2018-11-23 09:39:22,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:39:22,063 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:39:22,063 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:39:22,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:22,063 INFO L82 PathProgramCache]: Analyzing trace with hash -234514290, now seen corresponding path program 1 times [2018-11-23 09:39:22,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 09:39:22,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:22,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:22,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 09:39:22,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 09:39:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-23 09:39:22,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:22,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 09:39:22,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 615 with the following transitions: [2018-11-23 09:39:22,242 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [269], [272], [280], [283], [287], [289], [294], [297], [305], [307], [309], [312], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-23 09:39:22,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 09:39:22,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 09:39:22,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 09:39:22,632 INFO L272 AbstractInterpreter]: Visited 115 different actions 338 times. Merged at 95 different actions 194 times. Widened at 1 different actions 1 times. Performed 1791 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1791 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 37 fixpoints after 17 different actions. Largest state had 117 variables. [2018-11-23 09:39:22,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:39:22,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 09:39:22,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 09:39:22,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 09:39:22,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:39:22,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 09:39:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:39:22,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:39:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-23 09:39:22,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:39:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-11-23 09:39:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 09:39:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-23 09:39:23,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 09:39:23,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:39:23,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:39:23,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:39:23,086 INFO L87 Difference]: Start difference. First operand 3449 states and 4260 transitions. Second operand 4 states. [2018-11-23 09:39:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:39:23,261 INFO L93 Difference]: Finished difference Result 3947 states and 4887 transitions. [2018-11-23 09:39:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:39:23,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 614 [2018-11-23 09:39:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:39:23,264 INFO L225 Difference]: With dead ends: 3947 [2018-11-23 09:39:23,264 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 09:39:23,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:39:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 09:39:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 09:39:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 09:39:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 09:39:23,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2018-11-23 09:39:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:39:23,269 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 09:39:23,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:39:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 09:39:23,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:39:23,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 09:39:23,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 09:39:23,698 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 104 [2018-11-23 09:39:23,802 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2018-11-23 09:39:24,578 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2018-11-23 09:39:24,580 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:39:24,580 INFO L451 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2018-11-23 09:39:24,580 INFO L444 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-11-23 09:39:24,580 INFO L444 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-23 09:39:24,580 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2018-11-23 09:39:24,581 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L444 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-23 09:39:24,582 INFO L444 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2))) [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2018-11-23 09:39:24,582 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L451 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2018-11-23 09:39:24,583 INFO L444 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L451 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2018-11-23 09:39:24,583 INFO L448 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2018-11-23 09:39:24,584 INFO L444 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-23 09:39:24,584 INFO L444 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-23 09:39:24,584 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2018-11-23 09:39:24,584 INFO L444 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (and .cse7 .cse15 .cse1)))) [2018-11-23 09:39:24,584 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2018-11-23 09:39:24,584 INFO L444 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-23 09:39:24,584 INFO L448 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2018-11-23 09:39:24,584 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2018-11-23 09:39:24,584 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L444 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (< |ssl3_connect_#in~initial_state| 12292)) [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L444 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2018-11-23 09:39:24,585 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L444 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L444 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 211 511) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 211 511) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2018-11-23 09:39:24,586 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L444 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2018-11-23 09:39:24,587 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L444 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2018-11-23 09:39:24,588 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L444 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-23 09:39:24,589 INFO L444 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2018-11-23 09:39:24,589 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 09:39:24,590 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2018-11-23 09:39:24,590 INFO L444 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-23 09:39:24,590 INFO L448 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2018-11-23 09:39:24,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:39:24 BoogieIcfgContainer [2018-11-23 09:39:24,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 09:39:24,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:39:24,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:39:24,610 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:39:24,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:39:11" (3/4) ... [2018-11-23 09:39:24,613 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 09:39:24,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 09:39:24,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-23 09:39:24,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 09:39:24,626 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 09:39:24,627 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 09:39:24,627 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 09:39:24,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-23 09:39:24,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-23 09:39:24,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-23 09:39:24,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-23 09:39:24,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-23 09:39:24,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 [2018-11-23 09:39:24,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-23 09:39:24,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-11-23 09:39:24,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) [2018-11-23 09:39:24,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-23 09:39:24,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-11-23 09:39:24,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-23 09:39:24,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-23 09:39:24,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-23 09:39:24,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-23 09:39:24,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) [2018-11-23 09:39:24,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-23 09:39:24,699 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e30093f7-db11-4623-8cf9-d7dcc971545e/bin-2019/utaipan/witness.graphml [2018-11-23 09:39:24,699 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:39:24,700 INFO L168 Benchmark]: Toolchain (without parser) took 13903.74 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 952.7 MB in the beginning and 932.7 MB in the end (delta: 20.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,701 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:39:24,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.11 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 933.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,702 INFO L168 Benchmark]: Boogie Preprocessor took 35.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:39:24,702 INFO L168 Benchmark]: RCFGBuilder took 451.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,702 INFO L168 Benchmark]: TraceAbstraction took 13027.56 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 133.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,702 INFO L168 Benchmark]: Witness Printer took 89.70 ms. Allocated memory is still 2.3 GB. Free memory was 960.5 MB in the beginning and 932.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:39:24,704 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.11 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 933.9 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -218.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 451.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13027.56 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 960.5 MB in the end (delta: 133.6 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 89.70 ms. Allocated memory is still 2.3 GB. Free memory was 960.5 MB in the beginning and 932.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 12.9s OverallTime, 27 OverallIterations, 21 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 5438 SDtfs, 1928 SDslu, 3156 SDs, 0 SdLazy, 2637 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5190 GetRequests, 5139 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 5368 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 691 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21514 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2304 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 9147 NumberOfCodeBlocks, 8892 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 11659 ConstructedInterpolants, 0 QuantifiedInterpolants, 6471569 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4347 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 39 InterpolantComputations, 27 PerfectInterpolantSequences, 50371/50495 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...