./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/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 4189574b2550552a572f663e591e000dc3f42b46 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:43:37,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:43:37,370 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:43:37,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:43:37,383 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:43:37,387 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:43:37,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:43:37,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:43:37,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:43:37,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:43:37,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:43:37,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:43:37,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:43:37,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:43:37,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:43:37,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:43:37,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:43:37,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:43:37,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:43:37,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:43:37,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:43:37,418 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:43:37,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:43:37,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:43:37,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:43:37,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:43:37,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:43:37,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:43:37,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:43:37,428 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:43:37,428 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:43:37,429 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:43:37,429 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:43:37,429 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:43:37,430 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:43:37,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:43:37,432 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:43:37,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:43:37,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:43:37,448 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:43:37,448 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:43:37,448 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:43:37,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:43:37,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:43:37,449 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:43:37,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:43:37,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:43:37,449 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:43:37,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:43:37,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:43:37,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:43:37,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:43:37,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:43:37,451 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:43:37,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:43:37,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:43:37,453 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:43:37,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:43:37,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:43:37,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:43:37,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:43:37,454 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:43:37,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:43:37,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:43:37,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:43:37,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:43:37,456 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_660378c6-9ee8-40df-a5f6-9b38182522c3/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 -> 4189574b2550552a572f663e591e000dc3f42b46 [2018-10-26 19:43:37,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:43:37,513 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:43:37,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:43:37,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:43:37,524 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:43:37,525 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 19:43:37,593 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/data/26457bca4/a390748374a843a6a8eb45088d84f4d4/FLAG2d248f37b [2018-10-26 19:43:37,989 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:43:37,990 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/sv-benchmarks/c/ssh-simplified/s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 19:43:38,001 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/data/26457bca4/a390748374a843a6a8eb45088d84f4d4/FLAG2d248f37b [2018-10-26 19:43:38,022 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/data/26457bca4/a390748374a843a6a8eb45088d84f4d4 [2018-10-26 19:43:38,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:43:38,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:43:38,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:43:38,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:43:38,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:43:38,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e4022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38, skipping insertion in model container [2018-10-26 19:43:38,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:43:38,093 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:43:38,323 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:43:38,327 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:43:38,410 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:43:38,427 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:43:38,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38 WrapperNode [2018-10-26 19:43:38,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:43:38,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:43:38,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:43:38,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:43:38,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:43:38,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:43:38,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:43:38,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:43:38,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,532 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... [2018-10-26 19:43:38,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:43:38,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:43:38,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:43:38,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:43:38,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/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-10-26 19:43:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:43:38,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:43:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:43:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:43:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 19:43:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 19:43:38,756 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:43:38,756 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:43:39,030 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 19:43:39,035 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 19:43:39,993 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:43:39,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:39 BoogieIcfgContainer [2018-10-26 19:43:39,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:43:39,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:43:39,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:43:39,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:43:39,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:43:38" (1/3) ... [2018-10-26 19:43:40,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632f95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:43:40, skipping insertion in model container [2018-10-26 19:43:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:43:38" (2/3) ... [2018-10-26 19:43:40,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632f95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:43:40, skipping insertion in model container [2018-10-26 19:43:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:39" (3/3) ... [2018-10-26 19:43:40,003 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_4_true-unreach-call_true-termination.cil.c [2018-10-26 19:43:40,016 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:43:40,027 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:43:40,045 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:43:40,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:43:40,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:43:40,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:43:40,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:43:40,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:43:40,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:43:40,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:43:40,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:43:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-26 19:43:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 19:43:40,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:40,121 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:40,126 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:40,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-10-26 19:43:40,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:40,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:40,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:40,196 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:40,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:40,423 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:40,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:40,449 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-10-26 19:43:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:40,579 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-10-26 19:43:40,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:40,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 19:43:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:40,594 INFO L225 Difference]: With dead ends: 380 [2018-10-26 19:43:40,595 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 19:43:40,599 INFO L605 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-10-26 19:43:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 19:43:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-26 19:43:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 19:43:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-10-26 19:43:40,657 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-10-26 19:43:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:40,658 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-10-26 19:43:40,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-10-26 19:43:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 19:43:40,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:40,661 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:40,661 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:40,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash -770617106, now seen corresponding path program 1 times [2018-10-26 19:43:40,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:40,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:40,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:40,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:40,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:40,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:40,803 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-10-26 19:43:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:41,169 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-10-26 19:43:41,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:41,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 19:43:41,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:41,175 INFO L225 Difference]: With dead ends: 476 [2018-10-26 19:43:41,175 INFO L226 Difference]: Without dead ends: 266 [2018-10-26 19:43:41,177 INFO L605 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-10-26 19:43:41,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-26 19:43:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-10-26 19:43:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-26 19:43:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-10-26 19:43:41,219 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-10-26 19:43:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:41,219 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-10-26 19:43:41,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-10-26 19:43:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:43:41,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:41,222 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:41,222 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:41,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:41,222 INFO L82 PathProgramCache]: Analyzing trace with hash 304754323, now seen corresponding path program 1 times [2018-10-26 19:43:41,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:41,225 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:43:41,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:41,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:41,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:41,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:41,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:41,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:41,368 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-10-26 19:43:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:41,412 INFO L93 Difference]: Finished difference Result 404 states and 585 transitions. [2018-10-26 19:43:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:41,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:43:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:41,418 INFO L225 Difference]: With dead ends: 404 [2018-10-26 19:43:41,418 INFO L226 Difference]: Without dead ends: 280 [2018-10-26 19:43:41,420 INFO L605 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-10-26 19:43:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-26 19:43:41,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-10-26 19:43:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-26 19:43:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 402 transitions. [2018-10-26 19:43:41,441 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 402 transitions. Word has length 63 [2018-10-26 19:43:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:41,442 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 402 transitions. [2018-10-26 19:43:41,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 402 transitions. [2018-10-26 19:43:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:43:41,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:41,446 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:41,446 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:41,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:41,446 INFO L82 PathProgramCache]: Analyzing trace with hash 242714709, now seen corresponding path program 1 times [2018-10-26 19:43:41,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:41,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:41,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:41,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:43:41,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:41,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:41,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:41,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:41,584 INFO L87 Difference]: Start difference. First operand 280 states and 402 transitions. Second operand 3 states. [2018-10-26 19:43:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:42,335 INFO L93 Difference]: Finished difference Result 652 states and 968 transitions. [2018-10-26 19:43:42,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:42,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:43:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:42,342 INFO L225 Difference]: With dead ends: 652 [2018-10-26 19:43:42,342 INFO L226 Difference]: Without dead ends: 382 [2018-10-26 19:43:42,347 INFO L605 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-10-26 19:43:42,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-26 19:43:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 364. [2018-10-26 19:43:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-26 19:43:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 504 transitions. [2018-10-26 19:43:42,368 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 504 transitions. Word has length 63 [2018-10-26 19:43:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:42,369 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 504 transitions. [2018-10-26 19:43:42,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-10-26 19:43:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:43:42,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:42,375 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:42,375 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:42,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 108701203, now seen corresponding path program 1 times [2018-10-26 19:43:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:42,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:42,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:42,377 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:43:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:42,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:42,461 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:42,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:42,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:42,462 INFO L87 Difference]: Start difference. First operand 364 states and 504 transitions. Second operand 3 states. [2018-10-26 19:43:42,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:42,730 INFO L93 Difference]: Finished difference Result 768 states and 1078 transitions. [2018-10-26 19:43:42,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:42,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 19:43:42,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:42,734 INFO L225 Difference]: With dead ends: 768 [2018-10-26 19:43:42,734 INFO L226 Difference]: Without dead ends: 416 [2018-10-26 19:43:42,736 INFO L605 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-10-26 19:43:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-26 19:43:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 404. [2018-10-26 19:43:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-26 19:43:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 554 transitions. [2018-10-26 19:43:42,754 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 554 transitions. Word has length 63 [2018-10-26 19:43:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:42,755 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 554 transitions. [2018-10-26 19:43:42,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 554 transitions. [2018-10-26 19:43:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 19:43:42,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:42,758 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:42,758 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:42,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:42,759 INFO L82 PathProgramCache]: Analyzing trace with hash 991869018, now seen corresponding path program 1 times [2018-10-26 19:43:42,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:42,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:42,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:42,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:42,761 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:43:42,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:42,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:42,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:42,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:42,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:42,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:42,869 INFO L87 Difference]: Start difference. First operand 404 states and 554 transitions. Second operand 3 states. [2018-10-26 19:43:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:43,285 INFO L93 Difference]: Finished difference Result 904 states and 1278 transitions. [2018-10-26 19:43:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:43,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-26 19:43:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:43,290 INFO L225 Difference]: With dead ends: 904 [2018-10-26 19:43:43,291 INFO L226 Difference]: Without dead ends: 510 [2018-10-26 19:43:43,292 INFO L605 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-10-26 19:43:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-26 19:43:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 484. [2018-10-26 19:43:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-10-26 19:43:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 690 transitions. [2018-10-26 19:43:43,309 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 690 transitions. Word has length 77 [2018-10-26 19:43:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:43,310 INFO L481 AbstractCegarLoop]: Abstraction has 484 states and 690 transitions. [2018-10-26 19:43:43,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 690 transitions. [2018-10-26 19:43:43,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 19:43:43,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:43,313 INFO L375 BasicCegarLoop]: trace histogram [4, 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-10-26 19:43:43,313 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:43,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:43,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1032276431, now seen corresponding path program 1 times [2018-10-26 19:43:43,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:43,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:43,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:43,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:43,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 19:43:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:43,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:43,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:43,413 INFO L87 Difference]: Start difference. First operand 484 states and 690 transitions. Second operand 3 states. [2018-10-26 19:43:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:44,733 INFO L93 Difference]: Finished difference Result 1006 states and 1443 transitions. [2018-10-26 19:43:44,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:44,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-26 19:43:44,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:44,736 INFO L225 Difference]: With dead ends: 1006 [2018-10-26 19:43:44,736 INFO L226 Difference]: Without dead ends: 534 [2018-10-26 19:43:44,738 INFO L605 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-10-26 19:43:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-26 19:43:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 528. [2018-10-26 19:43:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-26 19:43:44,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 744 transitions. [2018-10-26 19:43:44,758 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 744 transitions. Word has length 81 [2018-10-26 19:43:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:44,759 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 744 transitions. [2018-10-26 19:43:44,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 744 transitions. [2018-10-26 19:43:44,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 19:43:44,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:44,762 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:44,762 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:44,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1497570332, now seen corresponding path program 1 times [2018-10-26 19:43:44,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:44,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:44,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:44,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:44,766 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 19:43:44,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:44,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:44,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:44,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:44,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:44,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:44,874 INFO L87 Difference]: Start difference. First operand 528 states and 744 transitions. Second operand 3 states. [2018-10-26 19:43:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:45,437 INFO L93 Difference]: Finished difference Result 1150 states and 1646 transitions. [2018-10-26 19:43:45,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:45,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 19:43:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:45,441 INFO L225 Difference]: With dead ends: 1150 [2018-10-26 19:43:45,441 INFO L226 Difference]: Without dead ends: 630 [2018-10-26 19:43:45,443 INFO L605 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-10-26 19:43:45,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-26 19:43:45,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 610. [2018-10-26 19:43:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 19:43:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 844 transitions. [2018-10-26 19:43:45,464 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 844 transitions. Word has length 102 [2018-10-26 19:43:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:45,465 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 844 transitions. [2018-10-26 19:43:45,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 844 transitions. [2018-10-26 19:43:45,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 19:43:45,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:45,468 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:45,469 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:45,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1631583838, now seen corresponding path program 1 times [2018-10-26 19:43:45,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:45,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:45,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 19:43:45,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:45,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:45,576 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:45,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:45,577 INFO L87 Difference]: Start difference. First operand 610 states and 844 transitions. Second operand 3 states. [2018-10-26 19:43:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:45,643 INFO L93 Difference]: Finished difference Result 1678 states and 2350 transitions. [2018-10-26 19:43:45,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:45,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 19:43:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:45,652 INFO L225 Difference]: With dead ends: 1678 [2018-10-26 19:43:45,653 INFO L226 Difference]: Without dead ends: 1080 [2018-10-26 19:43:45,654 INFO L605 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-10-26 19:43:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-10-26 19:43:45,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2018-10-26 19:43:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2018-10-26 19:43:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1515 transitions. [2018-10-26 19:43:45,689 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1515 transitions. Word has length 102 [2018-10-26 19:43:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:45,690 INFO L481 AbstractCegarLoop]: Abstraction has 1078 states and 1515 transitions. [2018-10-26 19:43:45,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1515 transitions. [2018-10-26 19:43:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 19:43:45,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:45,694 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:45,694 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:45,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:45,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1799986566, now seen corresponding path program 1 times [2018-10-26 19:43:45,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:45,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:45,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:45,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:45,698 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 19:43:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:45,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:45,798 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:45,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:45,801 INFO L87 Difference]: Start difference. First operand 1078 states and 1515 transitions. Second operand 3 states. [2018-10-26 19:43:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:46,098 INFO L93 Difference]: Finished difference Result 2144 states and 3024 transitions. [2018-10-26 19:43:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:46,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 19:43:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:46,105 INFO L225 Difference]: With dead ends: 2144 [2018-10-26 19:43:46,105 INFO L226 Difference]: Without dead ends: 1588 [2018-10-26 19:43:46,107 INFO L605 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-10-26 19:43:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2018-10-26 19:43:46,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1588. [2018-10-26 19:43:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1588 states. [2018-10-26 19:43:46,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 2235 transitions. [2018-10-26 19:43:46,152 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 2235 transitions. Word has length 102 [2018-10-26 19:43:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:46,153 INFO L481 AbstractCegarLoop]: Abstraction has 1588 states and 2235 transitions. [2018-10-26 19:43:46,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2235 transitions. [2018-10-26 19:43:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 19:43:46,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:46,155 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:46,156 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:46,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:46,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1084705271, now seen corresponding path program 1 times [2018-10-26 19:43:46,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:46,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:46,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:46,157 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 19:43:46,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:46,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:46,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:46,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:46,248 INFO L87 Difference]: Start difference. First operand 1588 states and 2235 transitions. Second operand 3 states. [2018-10-26 19:43:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:46,597 INFO L93 Difference]: Finished difference Result 2100 states and 2962 transitions. [2018-10-26 19:43:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:46,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-26 19:43:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:46,606 INFO L225 Difference]: With dead ends: 2100 [2018-10-26 19:43:46,607 INFO L226 Difference]: Without dead ends: 2098 [2018-10-26 19:43:46,608 INFO L605 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-10-26 19:43:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2018-10-26 19:43:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2098. [2018-10-26 19:43:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2018-10-26 19:43:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2959 transitions. [2018-10-26 19:43:46,663 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2959 transitions. Word has length 104 [2018-10-26 19:43:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:46,664 INFO L481 AbstractCegarLoop]: Abstraction has 2098 states and 2959 transitions. [2018-10-26 19:43:46,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2959 transitions. [2018-10-26 19:43:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-26 19:43:46,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:46,669 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:43:46,669 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:46,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1225308302, now seen corresponding path program 1 times [2018-10-26 19:43:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:46,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:46,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:46,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:46,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:46,795 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 19:43:46,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:46,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:46,796 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:46,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:46,798 INFO L87 Difference]: Start difference. First operand 2098 states and 2959 transitions. Second operand 3 states. [2018-10-26 19:43:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:47,412 INFO L93 Difference]: Finished difference Result 4592 states and 6582 transitions. [2018-10-26 19:43:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:47,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2018-10-26 19:43:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:47,421 INFO L225 Difference]: With dead ends: 4592 [2018-10-26 19:43:47,422 INFO L226 Difference]: Without dead ends: 2490 [2018-10-26 19:43:47,426 INFO L605 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-10-26 19:43:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2490 states. [2018-10-26 19:43:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2490 to 2378. [2018-10-26 19:43:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-10-26 19:43:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3375 transitions. [2018-10-26 19:43:47,485 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3375 transitions. Word has length 146 [2018-10-26 19:43:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:47,486 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 3375 transitions. [2018-10-26 19:43:47,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3375 transitions. [2018-10-26 19:43:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 19:43:47,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:47,491 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 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-10-26 19:43:47,491 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:47,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1487171346, now seen corresponding path program 1 times [2018-10-26 19:43:47,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:47,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:47,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:47,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:47,493 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 19:43:47,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:47,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:47,609 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:47,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:47,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:47,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:47,610 INFO L87 Difference]: Start difference. First operand 2378 states and 3375 transitions. Second operand 3 states. [2018-10-26 19:43:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:47,999 INFO L93 Difference]: Finished difference Result 4962 states and 7001 transitions. [2018-10-26 19:43:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:47,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-26 19:43:48,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:48,008 INFO L225 Difference]: With dead ends: 4962 [2018-10-26 19:43:48,008 INFO L226 Difference]: Without dead ends: 2596 [2018-10-26 19:43:48,013 INFO L605 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-10-26 19:43:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2018-10-26 19:43:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2570. [2018-10-26 19:43:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2018-10-26 19:43:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3607 transitions. [2018-10-26 19:43:48,083 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3607 transitions. Word has length 183 [2018-10-26 19:43:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:48,087 INFO L481 AbstractCegarLoop]: Abstraction has 2570 states and 3607 transitions. [2018-10-26 19:43:48,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3607 transitions. [2018-10-26 19:43:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 19:43:48,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:48,096 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 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-10-26 19:43:48,096 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:48,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1615391006, now seen corresponding path program 1 times [2018-10-26 19:43:48,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:48,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:48,099 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-10-26 19:43:48,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:48,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:48,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:48,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:48,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:48,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:48,251 INFO L87 Difference]: Start difference. First operand 2570 states and 3607 transitions. Second operand 3 states. [2018-10-26 19:43:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:48,397 INFO L93 Difference]: Finished difference Result 5360 states and 7502 transitions. [2018-10-26 19:43:48,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:48,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2018-10-26 19:43:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:48,407 INFO L225 Difference]: With dead ends: 5360 [2018-10-26 19:43:48,407 INFO L226 Difference]: Without dead ends: 2802 [2018-10-26 19:43:48,412 INFO L605 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-10-26 19:43:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2018-10-26 19:43:48,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2778. [2018-10-26 19:43:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2778 states. [2018-10-26 19:43:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 3855 transitions. [2018-10-26 19:43:48,471 INFO L78 Accepts]: Start accepts. Automaton has 2778 states and 3855 transitions. Word has length 205 [2018-10-26 19:43:48,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:48,471 INFO L481 AbstractCegarLoop]: Abstraction has 2778 states and 3855 transitions. [2018-10-26 19:43:48,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2778 states and 3855 transitions. [2018-10-26 19:43:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 19:43:48,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:48,478 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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-10-26 19:43:48,478 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:48,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -261333060, now seen corresponding path program 1 times [2018-10-26 19:43:48,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:48,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:48,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-10-26 19:43:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:48,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:48,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:48,621 INFO L87 Difference]: Start difference. First operand 2778 states and 3855 transitions. Second operand 3 states. [2018-10-26 19:43:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:49,391 INFO L93 Difference]: Finished difference Result 5832 states and 8102 transitions. [2018-10-26 19:43:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:49,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-26 19:43:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:49,406 INFO L225 Difference]: With dead ends: 5832 [2018-10-26 19:43:49,406 INFO L226 Difference]: Without dead ends: 3066 [2018-10-26 19:43:49,412 INFO L605 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-10-26 19:43:49,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2018-10-26 19:43:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3042. [2018-10-26 19:43:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3042 states. [2018-10-26 19:43:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 4159 transitions. [2018-10-26 19:43:49,469 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 4159 transitions. Word has length 230 [2018-10-26 19:43:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:49,469 INFO L481 AbstractCegarLoop]: Abstraction has 3042 states and 4159 transitions. [2018-10-26 19:43:49,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 4159 transitions. [2018-10-26 19:43:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-26 19:43:49,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:49,476 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 6, 6, 4, 4, 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-10-26 19:43:49,477 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:49,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:49,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1772060986, now seen corresponding path program 1 times [2018-10-26 19:43:49,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:49,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:49,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:49,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:49,479 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-10-26 19:43:49,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:49,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:49,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:49,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:49,597 INFO L87 Difference]: Start difference. First operand 3042 states and 4159 transitions. Second operand 3 states. [2018-10-26 19:43:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:49,954 INFO L93 Difference]: Finished difference Result 6312 states and 8622 transitions. [2018-10-26 19:43:49,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:49,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-26 19:43:49,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:49,965 INFO L225 Difference]: With dead ends: 6312 [2018-10-26 19:43:49,965 INFO L226 Difference]: Without dead ends: 3282 [2018-10-26 19:43:49,970 INFO L605 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-10-26 19:43:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2018-10-26 19:43:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3266. [2018-10-26 19:43:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3266 states. [2018-10-26 19:43:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3266 states to 3266 states and 4423 transitions. [2018-10-26 19:43:50,033 INFO L78 Accepts]: Start accepts. Automaton has 3266 states and 4423 transitions. Word has length 230 [2018-10-26 19:43:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:50,034 INFO L481 AbstractCegarLoop]: Abstraction has 3266 states and 4423 transitions. [2018-10-26 19:43:50,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3266 states and 4423 transitions. [2018-10-26 19:43:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 19:43:50,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:50,042 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:50,042 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:50,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -388473491, now seen corresponding path program 1 times [2018-10-26 19:43:50,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:50,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:50,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-10-26 19:43:50,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:50,200 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:50,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:50,202 INFO L87 Difference]: Start difference. First operand 3266 states and 4423 transitions. Second operand 3 states. [2018-10-26 19:43:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:50,361 INFO L93 Difference]: Finished difference Result 9478 states and 12805 transitions. [2018-10-26 19:43:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:50,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 19:43:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:50,393 INFO L225 Difference]: With dead ends: 9478 [2018-10-26 19:43:50,393 INFO L226 Difference]: Without dead ends: 6224 [2018-10-26 19:43:50,405 INFO L605 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-10-26 19:43:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2018-10-26 19:43:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6222. [2018-10-26 19:43:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6222 states. [2018-10-26 19:43:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6222 states to 6222 states and 8389 transitions. [2018-10-26 19:43:50,556 INFO L78 Accepts]: Start accepts. Automaton has 6222 states and 8389 transitions. Word has length 261 [2018-10-26 19:43:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:50,557 INFO L481 AbstractCegarLoop]: Abstraction has 6222 states and 8389 transitions. [2018-10-26 19:43:50,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6222 states and 8389 transitions. [2018-10-26 19:43:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 19:43:50,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:50,566 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:50,566 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:50,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1873099759, now seen corresponding path program 1 times [2018-10-26 19:43:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:50,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:50,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 496 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2018-10-26 19:43:50,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:50,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:50,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:50,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:50,687 INFO L87 Difference]: Start difference. First operand 6222 states and 8389 transitions. Second operand 3 states. [2018-10-26 19:43:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:51,387 INFO L93 Difference]: Finished difference Result 13040 states and 17466 transitions. [2018-10-26 19:43:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:51,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 19:43:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:51,403 INFO L225 Difference]: With dead ends: 13040 [2018-10-26 19:43:51,403 INFO L226 Difference]: Without dead ends: 6830 [2018-10-26 19:43:51,410 INFO L605 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-10-26 19:43:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2018-10-26 19:43:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 6798. [2018-10-26 19:43:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6798 states. [2018-10-26 19:43:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6798 states to 6798 states and 9045 transitions. [2018-10-26 19:43:51,509 INFO L78 Accepts]: Start accepts. Automaton has 6798 states and 9045 transitions. Word has length 261 [2018-10-26 19:43:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:51,509 INFO L481 AbstractCegarLoop]: Abstraction has 6798 states and 9045 transitions. [2018-10-26 19:43:51,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6798 states and 9045 transitions. [2018-10-26 19:43:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 19:43:51,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:51,524 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:51,524 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:51,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -478208852, now seen corresponding path program 1 times [2018-10-26 19:43:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:51,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:51,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:51,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1023 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2018-10-26 19:43:51,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:51,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:51,667 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:51,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:51,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:51,669 INFO L87 Difference]: Start difference. First operand 6798 states and 9045 transitions. Second operand 3 states. [2018-10-26 19:43:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:52,591 INFO L93 Difference]: Finished difference Result 13608 states and 18090 transitions. [2018-10-26 19:43:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:52,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 286 [2018-10-26 19:43:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:52,609 INFO L225 Difference]: With dead ends: 13608 [2018-10-26 19:43:52,609 INFO L226 Difference]: Without dead ends: 6822 [2018-10-26 19:43:52,618 INFO L605 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-10-26 19:43:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2018-10-26 19:43:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 6790. [2018-10-26 19:43:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6790 states. [2018-10-26 19:43:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6790 states to 6790 states and 8941 transitions. [2018-10-26 19:43:52,723 INFO L78 Accepts]: Start accepts. Automaton has 6790 states and 8941 transitions. Word has length 286 [2018-10-26 19:43:52,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:52,724 INFO L481 AbstractCegarLoop]: Abstraction has 6790 states and 8941 transitions. [2018-10-26 19:43:52,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6790 states and 8941 transitions. [2018-10-26 19:43:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-26 19:43:52,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:52,778 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:52,778 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:52,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:52,778 INFO L82 PathProgramCache]: Analyzing trace with hash 818436740, now seen corresponding path program 1 times [2018-10-26 19:43:52,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:52,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:52,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:52,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:52,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-10-26 19:43:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:52,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:52,929 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:52,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:52,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:52,930 INFO L87 Difference]: Start difference. First operand 6790 states and 8941 transitions. Second operand 3 states. [2018-10-26 19:43:53,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:53,533 INFO L93 Difference]: Finished difference Result 14384 states and 19226 transitions. [2018-10-26 19:43:53,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:53,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2018-10-26 19:43:53,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:53,549 INFO L225 Difference]: With dead ends: 14384 [2018-10-26 19:43:53,549 INFO L226 Difference]: Without dead ends: 7606 [2018-10-26 19:43:53,561 INFO L605 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-10-26 19:43:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2018-10-26 19:43:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7430. [2018-10-26 19:43:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7430 states. [2018-10-26 19:43:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9693 transitions. [2018-10-26 19:43:53,689 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9693 transitions. Word has length 297 [2018-10-26 19:43:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:53,689 INFO L481 AbstractCegarLoop]: Abstraction has 7430 states and 9693 transitions. [2018-10-26 19:43:53,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9693 transitions. [2018-10-26 19:43:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-26 19:43:53,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:53,707 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:53,707 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:53,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:53,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1064296007, now seen corresponding path program 1 times [2018-10-26 19:43:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:53,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:53,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2018-10-26 19:43:53,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:53,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:53,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:53,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:53,864 INFO L87 Difference]: Start difference. First operand 7430 states and 9693 transitions. Second operand 3 states. [2018-10-26 19:43:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:54,800 INFO L93 Difference]: Finished difference Result 15672 states and 20338 transitions. [2018-10-26 19:43:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:54,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2018-10-26 19:43:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:54,821 INFO L225 Difference]: With dead ends: 15672 [2018-10-26 19:43:54,822 INFO L226 Difference]: Without dead ends: 8254 [2018-10-26 19:43:54,832 INFO L605 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-10-26 19:43:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8254 states. [2018-10-26 19:43:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8254 to 7678. [2018-10-26 19:43:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7678 states. [2018-10-26 19:43:54,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7678 states to 7678 states and 9989 transitions. [2018-10-26 19:43:54,966 INFO L78 Accepts]: Start accepts. Automaton has 7678 states and 9989 transitions. Word has length 312 [2018-10-26 19:43:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:54,968 INFO L481 AbstractCegarLoop]: Abstraction has 7678 states and 9989 transitions. [2018-10-26 19:43:54,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 7678 states and 9989 transitions. [2018-10-26 19:43:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-26 19:43:54,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:54,986 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:54,987 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:54,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:54,988 INFO L82 PathProgramCache]: Analyzing trace with hash 242465044, now seen corresponding path program 1 times [2018-10-26 19:43:54,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:54,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:54,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2018-10-26 19:43:55,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:55,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:55,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:55,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:55,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:55,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:55,265 INFO L87 Difference]: Start difference. First operand 7678 states and 9989 transitions. Second operand 3 states. [2018-10-26 19:43:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:55,471 INFO L93 Difference]: Finished difference Result 12148 states and 15759 transitions. [2018-10-26 19:43:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:55,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2018-10-26 19:43:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:55,485 INFO L225 Difference]: With dead ends: 12148 [2018-10-26 19:43:55,485 INFO L226 Difference]: Without dead ends: 8230 [2018-10-26 19:43:55,492 INFO L605 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-10-26 19:43:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8230 states. [2018-10-26 19:43:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8230 to 8228. [2018-10-26 19:43:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8228 states. [2018-10-26 19:43:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 10671 transitions. [2018-10-26 19:43:55,603 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 10671 transitions. Word has length 313 [2018-10-26 19:43:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:55,604 INFO L481 AbstractCegarLoop]: Abstraction has 8228 states and 10671 transitions. [2018-10-26 19:43:55,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:55,604 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 10671 transitions. [2018-10-26 19:43:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-26 19:43:55,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:55,615 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:55,616 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:55,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:55,616 INFO L82 PathProgramCache]: Analyzing trace with hash -700783518, now seen corresponding path program 1 times [2018-10-26 19:43:55,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:55,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:55,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2018-10-26 19:43:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:43:55,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:43:55,764 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:43:55,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:43:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:43:55,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:43:55,765 INFO L87 Difference]: Start difference. First operand 8228 states and 10671 transitions. Second operand 3 states. [2018-10-26 19:43:56,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:43:56,226 INFO L93 Difference]: Finished difference Result 15999 states and 20730 transitions. [2018-10-26 19:43:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:43:56,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-10-26 19:43:56,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:43:56,243 INFO L225 Difference]: With dead ends: 15999 [2018-10-26 19:43:56,243 INFO L226 Difference]: Without dead ends: 8231 [2018-10-26 19:43:56,254 INFO L605 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-10-26 19:43:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8231 states. [2018-10-26 19:43:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8231 to 8197. [2018-10-26 19:43:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8197 states. [2018-10-26 19:43:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 10567 transitions. [2018-10-26 19:43:56,387 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 10567 transitions. Word has length 314 [2018-10-26 19:43:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:43:56,388 INFO L481 AbstractCegarLoop]: Abstraction has 8197 states and 10567 transitions. [2018-10-26 19:43:56,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:43:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 10567 transitions. [2018-10-26 19:43:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-26 19:43:56,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:43:56,400 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:43:56,400 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:43:56,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1845363507, now seen corresponding path program 1 times [2018-10-26 19:43:56,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:43:56,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:56,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:43:56,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:43:56,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:43:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:43:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 677 proven. 15 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-10-26 19:43:56,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:43:56,703 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:43:56,704 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2018-10-26 19:43:56,706 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [260], [263], [268], [271], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:43:56,783 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:43:56,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:43:58,194 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 19:43:58,197 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 103 variables. [2018-10-26 19:43:58,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:43:58,216 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 19:44:00,548 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 75.45% of their original sizes. [2018-10-26 19:44:00,548 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 19:44:02,628 INFO L415 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2018-10-26 19:44:02,629 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 19:44:02,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:44:02,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-26 19:44:02,630 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:44:02,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 19:44:02,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 19:44:02,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-26 19:44:02,631 INFO L87 Difference]: Start difference. First operand 8197 states and 10567 transitions. Second operand 14 states. [2018-10-26 19:44:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:44:09,907 INFO L93 Difference]: Finished difference Result 16387 states and 21124 transitions. [2018-10-26 19:44:09,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 19:44:09,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 337 [2018-10-26 19:44:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:44:09,918 INFO L225 Difference]: With dead ends: 16387 [2018-10-26 19:44:09,918 INFO L226 Difference]: Without dead ends: 8202 [2018-10-26 19:44:09,930 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-10-26 19:44:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8202 states. [2018-10-26 19:44:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8202 to 8201. [2018-10-26 19:44:10,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8201 states. [2018-10-26 19:44:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 10571 transitions. [2018-10-26 19:44:10,091 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 10571 transitions. Word has length 337 [2018-10-26 19:44:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:44:10,092 INFO L481 AbstractCegarLoop]: Abstraction has 8201 states and 10571 transitions. [2018-10-26 19:44:10,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 19:44:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 10571 transitions. [2018-10-26 19:44:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-26 19:44:10,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:44:10,102 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:44:10,102 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:44:10,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:44:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1601090738, now seen corresponding path program 1 times [2018-10-26 19:44:10,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:44:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:44:10,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:44:10,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:44:10,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:44:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:44:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-10-26 19:44:10,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:44:10,352 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:44:10,352 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 352 with the following transitions: [2018-10-26 19:44:10,353 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:44:10,358 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:44:10,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:44:13,440 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:46:12,025 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:46:12,025 INFO L272 AbstractInterpreter]: Visited 111 different actions 3730 times. Merged at 101 different actions 3176 times. Widened at 25 different actions 453 times. Found 430 fixpoints after 33 different actions. Largest state had 105 variables. [2018-10-26 19:46:12,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:12,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:46:12,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:12,036 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/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-10-26 19:46:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:46:12,044 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:46:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:12,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:46:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-10-26 19:46:12,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:46:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 701 proven. 15 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2018-10-26 19:46:12,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:46:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:46:12,502 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:46:12,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:46:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:46:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:46:12,503 INFO L87 Difference]: Start difference. First operand 8201 states and 10571 transitions. Second operand 4 states. [2018-10-26 19:46:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:46:13,622 INFO L93 Difference]: Finished difference Result 13515 states and 17305 transitions. [2018-10-26 19:46:13,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:46:13,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 351 [2018-10-26 19:46:13,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:46:13,647 INFO L225 Difference]: With dead ends: 13515 [2018-10-26 19:46:13,647 INFO L226 Difference]: Without dead ends: 9773 [2018-10-26 19:46:13,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:46:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2018-10-26 19:46:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 8342. [2018-10-26 19:46:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8342 states. [2018-10-26 19:46:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8342 states to 8342 states and 10572 transitions. [2018-10-26 19:46:13,828 INFO L78 Accepts]: Start accepts. Automaton has 8342 states and 10572 transitions. Word has length 351 [2018-10-26 19:46:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:46:13,828 INFO L481 AbstractCegarLoop]: Abstraction has 8342 states and 10572 transitions. [2018-10-26 19:46:13,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:46:13,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8342 states and 10572 transitions. [2018-10-26 19:46:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-26 19:46:13,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:46:13,848 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:46:13,848 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:46:13,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:13,848 INFO L82 PathProgramCache]: Analyzing trace with hash -702707181, now seen corresponding path program 2 times [2018-10-26 19:46:13,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:46:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:13,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:46:13,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:13,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:46:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 770 proven. 6 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2018-10-26 19:46:14,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:14,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:46:14,094 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 19:46:14,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 19:46:14,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:14,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 19:46:14,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 19:46:14,108 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 19:46:14,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 19:46:14,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:46:14,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:46:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-10-26 19:46:14,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:46:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1437 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-10-26 19:46:14,415 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 19:46:14,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-10-26 19:46:14,415 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:46:14,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:46:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:46:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:46:14,416 INFO L87 Difference]: Start difference. First operand 8342 states and 10572 transitions. Second operand 3 states. [2018-10-26 19:46:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:46:14,664 INFO L93 Difference]: Finished difference Result 15694 states and 19574 transitions. [2018-10-26 19:46:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:46:14,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-10-26 19:46:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:46:14,683 INFO L225 Difference]: With dead ends: 15694 [2018-10-26 19:46:14,684 INFO L226 Difference]: Without dead ends: 7368 [2018-10-26 19:46:14,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 730 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:46:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7368 states. [2018-10-26 19:46:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7368 to 7342. [2018-10-26 19:46:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7342 states. [2018-10-26 19:46:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7342 states to 7342 states and 8971 transitions. [2018-10-26 19:46:14,816 INFO L78 Accepts]: Start accepts. Automaton has 7342 states and 8971 transitions. Word has length 365 [2018-10-26 19:46:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:46:14,818 INFO L481 AbstractCegarLoop]: Abstraction has 7342 states and 8971 transitions. [2018-10-26 19:46:14,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:46:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7342 states and 8971 transitions. [2018-10-26 19:46:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-26 19:46:14,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:46:14,830 INFO L375 BasicCegarLoop]: trace histogram [17, 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, 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-10-26 19:46:14,832 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:46:14,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:46:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2052993450, now seen corresponding path program 1 times [2018-10-26 19:46:14,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:46:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:14,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:46:14,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:46:14,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:46:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:46:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:46:15,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:46:15,089 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:46:15,089 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-10-26 19:46:15,089 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [260], [263], [268], [271], [273], [279], [284], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:46:15,094 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:46:15,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:46:18,302 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:48:25,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:48:25,184 INFO L272 AbstractInterpreter]: Visited 113 different actions 3999 times. Merged at 103 different actions 3353 times. Widened at 25 different actions 463 times. Found 512 fixpoints after 42 different actions. Largest state had 105 variables. [2018-10-26 19:48:25,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:48:25,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:48:25,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:48:25,196 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/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-10-26 19:48:25,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:48:25,203 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:48:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:25,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:48:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:48:25,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:48:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1037 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 19:48:25,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:48:25,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:48:25,443 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:48:25,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:48:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:48:25,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:48:25,444 INFO L87 Difference]: Start difference. First operand 7342 states and 8971 transitions. Second operand 4 states. [2018-10-26 19:48:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:48:25,651 INFO L93 Difference]: Finished difference Result 16047 states and 19502 transitions. [2018-10-26 19:48:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:48:25,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2018-10-26 19:48:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:48:25,669 INFO L225 Difference]: With dead ends: 16047 [2018-10-26 19:48:25,669 INFO L226 Difference]: Without dead ends: 8789 [2018-10-26 19:48:25,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:48:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8789 states. [2018-10-26 19:48:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8789 to 7310. [2018-10-26 19:48:25,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2018-10-26 19:48:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 8875 transitions. [2018-10-26 19:48:25,805 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 8875 transitions. Word has length 398 [2018-10-26 19:48:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:48:25,805 INFO L481 AbstractCegarLoop]: Abstraction has 7310 states and 8875 transitions. [2018-10-26 19:48:25,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:48:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 8875 transitions. [2018-10-26 19:48:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-26 19:48:25,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:48:25,813 INFO L375 BasicCegarLoop]: trace histogram [18, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:48:25,814 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:48:25,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:48:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash -949119215, now seen corresponding path program 1 times [2018-10-26 19:48:25,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:48:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:48:25,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:48:25,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:48:25,818 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:48:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-26 19:48:25,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:48:25,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:48:25,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:48:25,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:48:25,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:48:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:48:25,985 INFO L87 Difference]: Start difference. First operand 7310 states and 8875 transitions. Second operand 3 states. [2018-10-26 19:48:26,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:48:26,639 INFO L93 Difference]: Finished difference Result 13243 states and 15988 transitions. [2018-10-26 19:48:26,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:48:26,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 438 [2018-10-26 19:48:26,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:48:26,644 INFO L225 Difference]: With dead ends: 13243 [2018-10-26 19:48:26,644 INFO L226 Difference]: Without dead ends: 3666 [2018-10-26 19:48:26,652 INFO L605 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-10-26 19:48:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2018-10-26 19:48:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3591. [2018-10-26 19:48:26,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3591 states. [2018-10-26 19:48:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3591 states to 3591 states and 4412 transitions. [2018-10-26 19:48:26,708 INFO L78 Accepts]: Start accepts. Automaton has 3591 states and 4412 transitions. Word has length 438 [2018-10-26 19:48:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:48:26,708 INFO L481 AbstractCegarLoop]: Abstraction has 3591 states and 4412 transitions. [2018-10-26 19:48:26,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:48:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3591 states and 4412 transitions. [2018-10-26 19:48:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-26 19:48:26,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:48:26,715 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 19:48:26,715 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:48:26,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:48:26,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1782371145, now seen corresponding path program 1 times [2018-10-26 19:48:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:48:26,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:48:26,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:48:26,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:48:26,716 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:48:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:48:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-10-26 19:48:26,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:48:26,998 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 19:48:26,998 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 506 with the following transitions: [2018-10-26 19:48:26,998 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [260], [263], [268], [271], [279], [282], [286], [288], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 19:48:27,003 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 19:48:27,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 19:48:29,039 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 19:50:17,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 19:50:17,334 INFO L272 AbstractInterpreter]: Visited 117 different actions 3838 times. Merged at 103 different actions 3256 times. Widened at 23 different actions 465 times. Found 455 fixpoints after 32 different actions. Largest state had 106 variables. [2018-10-26 19:50:17,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:50:17,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 19:50:17,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:50:17,343 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/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-10-26 19:50:17,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:50:17,356 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 19:50:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:50:17,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:50:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-10-26 19:50:17,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 19:50:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2656 backedges. 1573 proven. 15 refuted. 0 times theorem prover too weak. 1068 trivial. 0 not checked. [2018-10-26 19:50:17,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 19:50:17,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 19:50:17,797 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 19:50:17,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:50:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:50:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:50:17,798 INFO L87 Difference]: Start difference. First operand 3591 states and 4412 transitions. Second operand 4 states. [2018-10-26 19:50:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:50:17,904 INFO L93 Difference]: Finished difference Result 4100 states and 5049 transitions. [2018-10-26 19:50:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:50:17,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2018-10-26 19:50:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:50:17,906 INFO L225 Difference]: With dead ends: 4100 [2018-10-26 19:50:17,906 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 19:50:17,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 1010 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:50:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 19:50:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 19:50:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 19:50:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 19:50:17,911 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-10-26 19:50:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:50:17,911 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 19:50:17,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:50:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 19:50:17,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 19:50:17,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 19:50:17,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:17,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 19:50:18,348 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 91 [2018-10-26 19:50:19,076 WARN L179 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2018-10-26 19:50:19,964 WARN L179 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-10-26 19:50:19,986 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 19:50:19,986 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:50:19,986 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 19:50:19,987 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 19:50:19,987 INFO L421 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-10-26 19:50:19,987 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L421 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-10-26 19:50:19,988 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L421 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L421 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L421 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (or (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-10-26 19:50:19,989 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-10-26 19:50:19,990 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 297) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L283-2(lines 283 297) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L251-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-10-26 19:50:19,991 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4512 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1))) [2018-10-26 19:50:19,992 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~blastFlag~0 0))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= 4352 ssl3_connect_~s__state~0) (not (= ssl3_connect_~s__hit~0 0)) (<= ssl3_connect_~s__state~0 4560)))) [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 293) no Hoare annotation was computed. [2018-10-26 19:50:19,992 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse4 (<= 4560 ssl3_connect_~s__state~0)) (.cse6 (<= ssl3_connect_~s__state~0 4560)) (.cse8 (<= ssl3_connect_~s__state~0 3)) (.cse5 (not .cse1)) (.cse7 (<= ssl3_connect_~blastFlag~0 0)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (= ssl3_connect_~s__state~0 4512)) (.cse9 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 4352)) (.cse13 (<= 4352 ssl3_connect_~s__state~0)) (.cse10 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse11 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~blastFlag~0 4)) (.cse14 (= ssl3_connect_~s__state~0 4384))) (or (and .cse0 (= ssl3_connect_~s__state~0 4400) .cse1) (and .cse2 .cse3 .cse1) (and .cse0 .cse4 .cse5 .cse6) (and (= ssl3_connect_~s__state~0 4464) .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4448) .cse3 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4368)) (and .cse8 .cse9 .cse3 .cse10) (and .cse0 .cse11) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (= ssl3_connect_~s__state~0 4416) .cse3 .cse1) (and .cse9 .cse4 .cse3 .cse1 .cse6 .cse10) (and (= ssl3_connect_~s__state~0 4432) .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4496) .cse3 .cse1) (and .cse8 .cse9 .cse5) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse12 .cse13 .cse5) (and .cse14 .cse7) (and .cse0 .cse2) (and .cse9 .cse12 .cse13 .cse3 .cse1 .cse10) (and .cse11 .cse3 .cse1) (and .cse3 .cse1 (= ssl3_connect_~s__state~0 4480)) (and .cse14 (= ssl3_connect_~blastFlag~0 1))))) [2018-10-26 19:50:19,992 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L290-2(lines 285 297) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-10-26 19:50:19,993 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 261) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~blastFlag~0 2) .cse0 (not .cse1) .cse2) (not (= |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 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)))) [2018-10-26 19:50:19,994 INFO L421 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (= ssl3_connect_~blastFlag~0 1) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-10-26 19:50:19,994 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) 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 (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-10-26 19:50:19,995 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= 4432 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560))) [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-10-26 19:50:19,995 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-10-26 19:50:19,996 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point L266-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (= main_~s~0 12292) [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-10-26 19:50:19,996 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-10-26 19:50:20,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:50:20 BoogieIcfgContainer [2018-10-26 19:50:20,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:50:20,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:50:20,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:50:20,039 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:50:20,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:43:39" (3/4) ... [2018-10-26 19:50:20,045 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 19:50:20,059 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 19:50:20,059 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-26 19:50:20,059 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 19:50:20,067 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-26 19:50:20,068 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 19:50:20,068 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 19:50:20,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (blastFlag <= 0 && 4560 <= s__state) || !(\old(initial_state) == 12292) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state <= 4560) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:50:20,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4528)) || !(\old(initial_state) == 12292)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__state == 4384 && blastFlag <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || (s__state == 4384 && blastFlag == 1) [2018-10-26 19:50:20,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) [2018-10-26 19:50:20,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:50:20,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-10-26 19:50:20,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-10-26 19:50:20,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:50:20,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) [2018-10-26 19:50:20,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:50:20,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 19:50:20,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) [2018-10-26 19:50:20,099 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-10-26 19:50:20,156 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_660378c6-9ee8-40df-a5f6-9b38182522c3/bin-2019/utaipan/witness.graphml [2018-10-26 19:50:20,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:50:20,157 INFO L168 Benchmark]: Toolchain (without parser) took 402130.25 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 952.7 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 660.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,157 INFO L168 Benchmark]: CDTParser took 0.26 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-10-26 19:50:20,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 933.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,158 INFO L168 Benchmark]: Boogie Preprocessor took 213.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -252.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,158 INFO L168 Benchmark]: RCFGBuilder took 1320.77 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,158 INFO L168 Benchmark]: TraceAbstraction took 400043.19 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2018-10-26 19:50:20,159 INFO L168 Benchmark]: Witness Printer took 117.66 ms. Allocated memory is still 5.1 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 19:50:20,165 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.26 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 399.29 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.55 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 933.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 213.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 933.9 MB in the beginning and 1.2 GB in the end (delta: -252.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1320.77 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: 59.2 MB). Peak memory consumption was 59.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 400043.19 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. * Witness Printer took 117.66 ms. Allocated memory is still 5.1 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: 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: 189]: Loop Invariant Derived loop invariant: ((((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state <= 4560) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (blastFlag <= 0 && s__state == 4368)) || ((((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && !(s__hit == 0)) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0) || !(\old(initial_state) == 12292)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (blastFlag <= 0 && 4560 <= s__state) || !(\old(initial_state) == 12292) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && !(s__hit == 0)) && s__state <= 4560)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 0 && s__state == 4368)) || (((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && blastFlag <= 4) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 2 && s__state == 4528)) || !(\old(initial_state) == 12292)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || (((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && s__s3__tmp__next_state___0 <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || (s__state == 4384 && blastFlag <= 0)) || (blastFlag <= 2 && s__state == 4512)) || (((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && s__state == 4480)) || (s__state == 4384 && blastFlag == 1) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) || !(\old(initial_state) == 12292) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4512 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292)) || (((4512 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || ((4352 <= s__state && blastFlag == 1) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 399.9s OverallTime, 29 OverallIterations, 18 TraceHistogramMax, 20.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5978 SDtfs, 1993 SDslu, 3786 SDs, 0 SdLazy, 2940 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 3666 GetRequests, 3610 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8342occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 363.6s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.9947411003236248 AbsIntWeakeningRatio, 0.41369047619047616 AbsIntAvgWeakeningVarsNumRemoved, 400.98809523809524 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 4160 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 166 NumberOfFragments, 577 HoareAnnotationTreeSize, 26 FomulaSimplifications, 19680 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 1769 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 7883 NumberOfCodeBlocks, 7604 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9465 ConstructedInterpolants, 0 QuantifiedInterpolants, 3960130 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2568 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 35170/35299 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...