./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/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 1236ee922960b2737aa65707c3f9d27b28eaa4fc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:54:38,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:54:38,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:54:38,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:54:38,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:54:38,771 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:54:38,772 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:54:38,773 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:54:38,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:54:38,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:54:38,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:54:38,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:54:38,776 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:54:38,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:54:38,778 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:54:38,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:54:38,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:54:38,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:54:38,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:54:38,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:54:38,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:54:38,784 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:54:38,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:54:38,786 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:54:38,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:54:38,787 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:54:38,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:54:38,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:54:38,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:54:38,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:54:38,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:54:38,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:54:38,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:54:38,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:54:38,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:54:38,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:54:38,792 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:54:38,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:54:38,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:54:38,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:54:38,801 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:54:38,801 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:54:38,801 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:54:38,801 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:54:38,802 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:54:38,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:54:38,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:54:38,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:54:38,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:54:38,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:54:38,803 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:54:38,804 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:54:38,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:54:38,805 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:54:38,805 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:54:38,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:54:38,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:54:38,806 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:54:38,806 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_9e394bb6-9967-4be1-9a7e-8357a0623459/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 -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-11-22 23:54:38,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:54:38,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:54:38,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:54:38,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:54:38,842 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:54:38,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-22 23:54:38,880 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/data/0def7bc6a/db66a1af1e5f4b2490a350a966750a37/FLAG12995b390 [2018-11-22 23:54:39,308 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:54:39,309 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-22 23:54:39,316 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/data/0def7bc6a/db66a1af1e5f4b2490a350a966750a37/FLAG12995b390 [2018-11-22 23:54:39,326 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/data/0def7bc6a/db66a1af1e5f4b2490a350a966750a37 [2018-11-22 23:54:39,327 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:54:39,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:54:39,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:54:39,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:54:39,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:54:39,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1400b520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39, skipping insertion in model container [2018-11-22 23:54:39,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:54:39,366 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:54:39,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:54:39,518 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:54:39,556 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:54:39,564 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:54:39,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39 WrapperNode [2018-11-22 23:54:39,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:54:39,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:54:39,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:54:39,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:54:39,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:54:39,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:54:39,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:54:39,620 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:54:39,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... [2018-11-22 23:54:39,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:54:39,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:54:39,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:54:39,649 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:54:39,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:54:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:54:39,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:54:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-22 23:54:39,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-22 23:54:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:54:39,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:54:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:54:39,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:54:39,795 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-22 23:54:39,796 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-22 23:54:40,170 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:54:40,170 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 23:54:40,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:40 BoogieIcfgContainer [2018-11-22 23:54:40,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:54:40,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:54:40,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:54:40,174 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:54:40,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:54:39" (1/3) ... [2018-11-22 23:54:40,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6501951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:54:40, skipping insertion in model container [2018-11-22 23:54:40,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:54:39" (2/3) ... [2018-11-22 23:54:40,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6501951d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:54:40, skipping insertion in model container [2018-11-22 23:54:40,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:40" (3/3) ... [2018-11-22 23:54:40,177 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-22 23:54:40,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:54:40,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:54:40,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:54:40,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:54:40,238 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:54:40,238 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:54:40,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:54:40,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:54:40,238 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:54:40,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:54:40,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:54:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-22 23:54:40,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 23:54:40,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:40,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:40,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:40,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2018-11-22 23:54:40,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:40,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:40,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:54:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:40,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:40,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:40,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:40,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,442 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-22 23:54:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:40,520 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2018-11-22 23:54:40,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:40,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 23:54:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:40,531 INFO L225 Difference]: With dead ends: 377 [2018-11-22 23:54:40,532 INFO L226 Difference]: Without dead ends: 220 [2018-11-22 23:54:40,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-22 23:54:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-11-22 23:54:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-22 23:54:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2018-11-22 23:54:40,575 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2018-11-22 23:54:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:40,575 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2018-11-22 23:54:40,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2018-11-22 23:54:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-22 23:54:40,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:40,577 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:40,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:40,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:40,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1426924635, now seen corresponding path program 1 times [2018-11-22 23:54:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:54:40,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:40,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:40,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:40,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:40,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:40,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,634 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2018-11-22 23:54:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:40,748 INFO L93 Difference]: Finished difference Result 470 states and 707 transitions. [2018-11-22 23:54:40,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:40,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-22 23:54:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:40,750 INFO L225 Difference]: With dead ends: 470 [2018-11-22 23:54:40,750 INFO L226 Difference]: Without dead ends: 262 [2018-11-22 23:54:40,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-22 23:54:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2018-11-22 23:54:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-22 23:54:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2018-11-22 23:54:40,765 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2018-11-22 23:54:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:40,766 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2018-11-22 23:54:40,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2018-11-22 23:54:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-22 23:54:40,767 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:40,767 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:40,768 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:40,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1669760968, now seen corresponding path program 1 times [2018-11-22 23:54:40,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:40,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:40,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:54:40,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:40,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:40,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:40,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:40,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:40,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,826 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2018-11-22 23:54:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:40,982 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2018-11-22 23:54:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:40,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-22 23:54:40,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:40,984 INFO L225 Difference]: With dead ends: 598 [2018-11-22 23:54:40,984 INFO L226 Difference]: Without dead ends: 354 [2018-11-22 23:54:40,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-22 23:54:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2018-11-22 23:54:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-22 23:54:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2018-11-22 23:54:41,002 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2018-11-22 23:54:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,002 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2018-11-22 23:54:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2018-11-22 23:54:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-22 23:54:41,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,005 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,005 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 819767994, now seen corresponding path program 1 times [2018-11-22 23:54:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:54:41,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,060 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2018-11-22 23:54:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,176 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2018-11-22 23:54:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-22 23:54:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,178 INFO L225 Difference]: With dead ends: 708 [2018-11-22 23:54:41,178 INFO L226 Difference]: Without dead ends: 384 [2018-11-22 23:54:41,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-22 23:54:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2018-11-22 23:54:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-22 23:54:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2018-11-22 23:54:41,192 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2018-11-22 23:54:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,193 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2018-11-22 23:54:41,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2018-11-22 23:54:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 23:54:41,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,195 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,195 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1719879938, now seen corresponding path program 1 times [2018-11-22 23:54:41,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-22 23:54:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,255 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,256 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2018-11-22 23:54:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,382 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2018-11-22 23:54:41,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-22 23:54:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,384 INFO L225 Difference]: With dead ends: 842 [2018-11-22 23:54:41,384 INFO L226 Difference]: Without dead ends: 478 [2018-11-22 23:54:41,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-11-22 23:54:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2018-11-22 23:54:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-11-22 23:54:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2018-11-22 23:54:41,399 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2018-11-22 23:54:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,399 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2018-11-22 23:54:41,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2018-11-22 23:54:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-22 23:54:41,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,401 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1093696729, now seen corresponding path program 1 times [2018-11-22 23:54:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-22 23:54:41,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,448 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2018-11-22 23:54:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,562 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2018-11-22 23:54:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-22 23:54:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,566 INFO L225 Difference]: With dead ends: 940 [2018-11-22 23:54:41,566 INFO L226 Difference]: Without dead ends: 500 [2018-11-22 23:54:41,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-11-22 23:54:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2018-11-22 23:54:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-11-22 23:54:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2018-11-22 23:54:41,577 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2018-11-22 23:54:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,578 INFO L480 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2018-11-22 23:54:41,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2018-11-22 23:54:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-22 23:54:41,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,579 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1180839903, now seen corresponding path program 1 times [2018-11-22 23:54:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 23:54:41,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,624 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2018-11-22 23:54:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,657 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2018-11-22 23:54:41,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2018-11-22 23:54:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,659 INFO L225 Difference]: With dead ends: 976 [2018-11-22 23:54:41,660 INFO L226 Difference]: Without dead ends: 734 [2018-11-22 23:54:41,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-11-22 23:54:41,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2018-11-22 23:54:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-22 23:54:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2018-11-22 23:54:41,671 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2018-11-22 23:54:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,672 INFO L480 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2018-11-22 23:54:41,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2018-11-22 23:54:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-22 23:54:41,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,673 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash 866854985, now seen corresponding path program 1 times [2018-11-22 23:54:41,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-22 23:54:41,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,716 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2018-11-22 23:54:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,743 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2018-11-22 23:54:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-22 23:54:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,746 INFO L225 Difference]: With dead ends: 976 [2018-11-22 23:54:41,746 INFO L226 Difference]: Without dead ends: 974 [2018-11-22 23:54:41,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2018-11-22 23:54:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2018-11-22 23:54:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-22 23:54:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2018-11-22 23:54:41,761 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2018-11-22 23:54:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2018-11-22 23:54:41,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2018-11-22 23:54:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-22 23:54:41,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,764 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:41,764 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -394036509, now seen corresponding path program 1 times [2018-11-22 23:54:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-22 23:54:41,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,812 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2018-11-22 23:54:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:41,926 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2018-11-22 23:54:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:41,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-11-22 23:54:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:41,929 INFO L225 Difference]: With dead ends: 2140 [2018-11-22 23:54:41,929 INFO L226 Difference]: Without dead ends: 1170 [2018-11-22 23:54:41,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-11-22 23:54:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2018-11-22 23:54:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-11-22 23:54:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2018-11-22 23:54:41,947 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 168 [2018-11-22 23:54:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:41,947 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2018-11-22 23:54:41,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:41,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2018-11-22 23:54:41,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-22 23:54:41,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:41,950 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 4, 4, 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] [2018-11-22 23:54:41,950 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:41,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:41,950 INFO L82 PathProgramCache]: Analyzing trace with hash 531653490, now seen corresponding path program 1 times [2018-11-22 23:54:41,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:41,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:41,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-22 23:54:41,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:41,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:41,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:41,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:41,992 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2018-11-22 23:54:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:42,098 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2018-11-22 23:54:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:42,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-11-22 23:54:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:42,104 INFO L225 Difference]: With dead ends: 2354 [2018-11-22 23:54:42,105 INFO L226 Difference]: Without dead ends: 1236 [2018-11-22 23:54:42,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-22 23:54:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2018-11-22 23:54:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-22 23:54:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2018-11-22 23:54:42,132 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 204 [2018-11-22 23:54:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:42,133 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2018-11-22 23:54:42,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2018-11-22 23:54:42,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-22 23:54:42,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:42,137 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:42,137 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:42,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash -354539531, now seen corresponding path program 1 times [2018-11-22 23:54:42,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:42,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-11-22 23:54:42,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:42,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:42,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:42,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:42,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:42,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,193 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2018-11-22 23:54:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:42,294 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2018-11-22 23:54:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:42,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2018-11-22 23:54:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:42,299 INFO L225 Difference]: With dead ends: 2544 [2018-11-22 23:54:42,299 INFO L226 Difference]: Without dead ends: 1334 [2018-11-22 23:54:42,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-22 23:54:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2018-11-22 23:54:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2018-11-22 23:54:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2018-11-22 23:54:42,330 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 225 [2018-11-22 23:54:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:42,330 INFO L480 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2018-11-22 23:54:42,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:42,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2018-11-22 23:54:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-22 23:54:42,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:42,334 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-22 23:54:42,334 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:42,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1874601560, now seen corresponding path program 1 times [2018-11-22 23:54:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:42,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-22 23:54:42,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:42,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:42,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:42,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,414 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2018-11-22 23:54:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:42,531 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2018-11-22 23:54:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:42,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-22 23:54:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:42,536 INFO L225 Difference]: With dead ends: 2752 [2018-11-22 23:54:42,537 INFO L226 Difference]: Without dead ends: 1442 [2018-11-22 23:54:42,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-11-22 23:54:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2018-11-22 23:54:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-11-22 23:54:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2018-11-22 23:54:42,570 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 249 [2018-11-22 23:54:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:42,570 INFO L480 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2018-11-22 23:54:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2018-11-22 23:54:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-22 23:54:42,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:42,574 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 8, 8, 6, 6, 4, 4, 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] [2018-11-22 23:54:42,574 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:42,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1835594086, now seen corresponding path program 1 times [2018-11-22 23:54:42,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:42,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 546 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-11-22 23:54:42,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:42,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:42,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:42,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:42,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:42,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,657 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2018-11-22 23:54:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:42,765 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2018-11-22 23:54:42,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:42,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-22 23:54:42,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:42,771 INFO L225 Difference]: With dead ends: 2992 [2018-11-22 23:54:42,771 INFO L226 Difference]: Without dead ends: 1570 [2018-11-22 23:54:42,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-22 23:54:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2018-11-22 23:54:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-22 23:54:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2018-11-22 23:54:42,805 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 249 [2018-11-22 23:54:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:42,805 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2018-11-22 23:54:42,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2018-11-22 23:54:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-22 23:54:42,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:42,810 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-22 23:54:42,810 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:42,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1915187928, now seen corresponding path program 1 times [2018-11-22 23:54:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-11-22 23:54:42,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:42,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:42,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:42,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,881 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2018-11-22 23:54:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:42,918 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2018-11-22 23:54:42,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:42,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-22 23:54:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:42,927 INFO L225 Difference]: With dead ends: 4646 [2018-11-22 23:54:42,927 INFO L226 Difference]: Without dead ends: 3100 [2018-11-22 23:54:42,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-22 23:54:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2018-11-22 23:54:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2018-11-22 23:54:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2018-11-22 23:54:42,989 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 279 [2018-11-22 23:54:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:42,990 INFO L480 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2018-11-22 23:54:42,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2018-11-22 23:54:42,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-22 23:54:42,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:42,996 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-22 23:54:42,996 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:42,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:42,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1795007718, now seen corresponding path program 1 times [2018-11-22 23:54:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:42,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:42,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-11-22 23:54:43,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:43,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:43,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:43,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:43,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,066 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2018-11-22 23:54:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:43,207 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2018-11-22 23:54:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:43,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-22 23:54:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:43,216 INFO L225 Difference]: With dead ends: 6484 [2018-11-22 23:54:43,216 INFO L226 Difference]: Without dead ends: 3398 [2018-11-22 23:54:43,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2018-11-22 23:54:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2018-11-22 23:54:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2018-11-22 23:54:43,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2018-11-22 23:54:43,278 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 279 [2018-11-22 23:54:43,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:43,279 INFO L480 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2018-11-22 23:54:43,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2018-11-22 23:54:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-22 23:54:43,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:43,285 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:43,286 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:43,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1052232894, now seen corresponding path program 1 times [2018-11-22 23:54:43,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:43,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-11-22 23:54:43,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:43,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:43,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:43,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:43,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,356 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2018-11-22 23:54:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:43,481 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2018-11-22 23:54:43,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:43,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2018-11-22 23:54:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:43,491 INFO L225 Difference]: With dead ends: 6900 [2018-11-22 23:54:43,492 INFO L226 Difference]: Without dead ends: 3530 [2018-11-22 23:54:43,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2018-11-22 23:54:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2018-11-22 23:54:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2018-11-22 23:54:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2018-11-22 23:54:43,554 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 303 [2018-11-22 23:54:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:43,554 INFO L480 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2018-11-22 23:54:43,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2018-11-22 23:54:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-11-22 23:54:43,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:43,559 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:43,560 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:43,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:43,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1022376132, now seen corresponding path program 1 times [2018-11-22 23:54:43,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-22 23:54:43,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:43,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:43,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:43,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:43,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,656 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2018-11-22 23:54:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:43,803 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2018-11-22 23:54:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:43,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2018-11-22 23:54:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:43,810 INFO L225 Difference]: With dead ends: 7416 [2018-11-22 23:54:43,810 INFO L226 Difference]: Without dead ends: 3914 [2018-11-22 23:54:43,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2018-11-22 23:54:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2018-11-22 23:54:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2018-11-22 23:54:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2018-11-22 23:54:43,852 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 314 [2018-11-22 23:54:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:43,852 INFO L480 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2018-11-22 23:54:43,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2018-11-22 23:54:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-22 23:54:43,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:43,856 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-22 23:54:43,856 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:43,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash -773017638, now seen corresponding path program 1 times [2018-11-22 23:54:43,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:43,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:43,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-11-22 23:54:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:43,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:43,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:43,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:43,911 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2018-11-22 23:54:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:44,020 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2018-11-22 23:54:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:44,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-22 23:54:44,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:44,031 INFO L225 Difference]: With dead ends: 8048 [2018-11-22 23:54:44,031 INFO L226 Difference]: Without dead ends: 4234 [2018-11-22 23:54:44,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2018-11-22 23:54:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2018-11-22 23:54:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2018-11-22 23:54:44,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2018-11-22 23:54:44,078 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 328 [2018-11-22 23:54:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:44,079 INFO L480 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2018-11-22 23:54:44,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:44,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2018-11-22 23:54:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-11-22 23:54:44,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:44,083 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:44,083 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:44,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:44,083 INFO L82 PathProgramCache]: Analyzing trace with hash -815480887, now seen corresponding path program 1 times [2018-11-22 23:54:44,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:44,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:44,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2018-11-22 23:54:44,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:44,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:44,181 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:44,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:44,182 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2018-11-22 23:54:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:44,259 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2018-11-22 23:54:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:44,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2018-11-22 23:54:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:44,270 INFO L225 Difference]: With dead ends: 11310 [2018-11-22 23:54:44,270 INFO L226 Difference]: Without dead ends: 7376 [2018-11-22 23:54:44,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2018-11-22 23:54:44,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2018-11-22 23:54:44,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2018-11-22 23:54:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2018-11-22 23:54:44,388 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 329 [2018-11-22 23:54:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:44,388 INFO L480 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2018-11-22 23:54:44,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2018-11-22 23:54:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-22 23:54:44,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:44,397 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-22 23:54:44,397 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:44,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 415461791, now seen corresponding path program 1 times [2018-11-22 23:54:44,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2018-11-22 23:54:44,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:44,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:44,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:44,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:44,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:44,505 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2018-11-22 23:54:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:44,671 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2018-11-22 23:54:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:44,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2018-11-22 23:54:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:44,685 INFO L225 Difference]: With dead ends: 14744 [2018-11-22 23:54:44,685 INFO L226 Difference]: Without dead ends: 7382 [2018-11-22 23:54:44,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2018-11-22 23:54:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2018-11-22 23:54:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2018-11-22 23:54:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2018-11-22 23:54:44,807 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 330 [2018-11-22 23:54:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:44,808 INFO L480 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2018-11-22 23:54:44,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2018-11-22 23:54:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-11-22 23:54:44,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:44,816 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:44,816 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:44,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:44,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1238161908, now seen corresponding path program 1 times [2018-11-22 23:54:44,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:44,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 874 proven. 10 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2018-11-22 23:54:44,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:44,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:54:44,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 354 with the following transitions: [2018-11-22 23:54:44,973 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [250], [253], [261], [264], [269], [272], [274], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-22 23:54:45,011 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:54:45,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:54:45,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:54:45,778 INFO L272 AbstractInterpreter]: Visited 103 different actions 376 times. Merged at 85 different actions 233 times. Widened at 1 different actions 1 times. Performed 2003 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2003 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 49 fixpoints after 25 different actions. Largest state had 103 variables. [2018-11-22 23:54:45,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:45,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:54:45,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:45,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:54:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:45,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:54:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:45,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:54:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-22 23:54:45,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:54:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-11-22 23:54:46,060 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:54:46,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 10 [2018-11-22 23:54:46,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:46,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:54:46,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:54:46,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:54:46,062 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2018-11-22 23:54:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:46,432 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2018-11-22 23:54:46,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:54:46,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 353 [2018-11-22 23:54:46,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:46,445 INFO L225 Difference]: With dead ends: 14866 [2018-11-22 23:54:46,445 INFO L226 Difference]: Without dead ends: 7500 [2018-11-22 23:54:46,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 701 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:54:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2018-11-22 23:54:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2018-11-22 23:54:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2018-11-22 23:54:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2018-11-22 23:54:46,603 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 353 [2018-11-22 23:54:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:46,603 INFO L480 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2018-11-22 23:54:46,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:54:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2018-11-22 23:54:46,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-11-22 23:54:46,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:46,615 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:46,616 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:46,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1456365214, now seen corresponding path program 1 times [2018-11-22 23:54:46,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:46,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:46,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:46,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-22 23:54:46,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:46,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:54:46,759 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 367 with the following transitions: [2018-11-22 23:54:46,760 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [253], [261], [264], [269], [272], [274], [280], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-22 23:54:46,763 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:54:46,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:54:47,162 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:54:47,162 INFO L272 AbstractInterpreter]: Visited 112 different actions 338 times. Merged at 94 different actions 193 times. Widened at 1 different actions 1 times. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 43 fixpoints after 18 different actions. Largest state had 105 variables. [2018-11-22 23:54:47,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:47,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:54:47,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:47,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:54:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:47,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:54:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:47,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:54:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-22 23:54:47,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:54:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 904 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2018-11-22 23:54:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:54:47,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-22 23:54:47,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:54:47,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:54:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:54:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:54:47,560 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2018-11-22 23:54:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:47,943 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2018-11-22 23:54:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:54:47,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2018-11-22 23:54:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:47,961 INFO L225 Difference]: With dead ends: 14624 [2018-11-22 23:54:47,961 INFO L226 Difference]: Without dead ends: 11034 [2018-11-22 23:54:47,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 732 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:54:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2018-11-22 23:54:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2018-11-22 23:54:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2018-11-22 23:54:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2018-11-22 23:54:48,127 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 366 [2018-11-22 23:54:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:48,127 INFO L480 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2018-11-22 23:54:48,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:54:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2018-11-22 23:54:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-11-22 23:54:48,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:48,139 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:48,139 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:48,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1345653892, now seen corresponding path program 2 times [2018-11-22 23:54:48,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:48,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:48,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-22 23:54:48,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:48,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:54:48,260 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:54:48,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:54:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:48,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:54:48,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:54:48,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:54:48,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-22 23:54:48,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:54:48,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:54:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-22 23:54:48,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:54:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2018-11-22 23:54:48,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:54:48,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-22 23:54:48,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:54:48,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:54:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:54:48,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:54:48,530 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 4 states. [2018-11-22 23:54:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:48,764 INFO L93 Difference]: Finished difference Result 19118 states and 24882 transitions. [2018-11-22 23:54:48,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:54:48,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2018-11-22 23:54:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:48,776 INFO L225 Difference]: With dead ends: 19118 [2018-11-22 23:54:48,776 INFO L226 Difference]: Without dead ends: 10668 [2018-11-22 23:54:48,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:54:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10668 states. [2018-11-22 23:54:48,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10668 to 8518. [2018-11-22 23:54:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2018-11-22 23:54:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10888 transitions. [2018-11-22 23:54:48,887 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10888 transitions. Word has length 379 [2018-11-22 23:54:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:48,887 INFO L480 AbstractCegarLoop]: Abstraction has 8518 states and 10888 transitions. [2018-11-22 23:54:48,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:54:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10888 transitions. [2018-11-22 23:54:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-11-22 23:54:48,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:48,895 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:48,895 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:48,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash -391768364, now seen corresponding path program 1 times [2018-11-22 23:54:48,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:48,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:48,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:54:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:48,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2018-11-22 23:54:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:54:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:54:48,982 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:48,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:48,983 INFO L87 Difference]: Start difference. First operand 8518 states and 10888 transitions. Second operand 3 states. [2018-11-22 23:54:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:49,126 INFO L93 Difference]: Finished difference Result 15876 states and 19733 transitions. [2018-11-22 23:54:49,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:49,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2018-11-22 23:54:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:49,131 INFO L225 Difference]: With dead ends: 15876 [2018-11-22 23:54:49,131 INFO L226 Difference]: Without dead ends: 3820 [2018-11-22 23:54:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:54:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2018-11-22 23:54:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3610. [2018-11-22 23:54:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3610 states. [2018-11-22 23:54:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 4508 transitions. [2018-11-22 23:54:49,169 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 4508 transitions. Word has length 418 [2018-11-22 23:54:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:49,170 INFO L480 AbstractCegarLoop]: Abstraction has 3610 states and 4508 transitions. [2018-11-22 23:54:49,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 4508 transitions. [2018-11-22 23:54:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-11-22 23:54:49,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:49,174 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:49,174 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:49,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1077932443, now seen corresponding path program 1 times [2018-11-22 23:54:49,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:49,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:49,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:49,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1648 proven. 14 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2018-11-22 23:54:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:54:49,366 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 517 with the following transitions: [2018-11-22 23:54:49,366 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [253], [261], [264], [269], [272], [274], [280], [283], [285], [287], [289], [292], [294], [297], [305], [307], [309], [312], [314], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-22 23:54:49,369 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:54:49,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:54:49,552 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:54:49,552 INFO L272 AbstractInterpreter]: Visited 119 different actions 264 times. Merged at 97 different actions 122 times. Widened at 2 different actions 2 times. Performed 1284 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1284 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 19 different actions. Largest state had 106 variables. [2018-11-22 23:54:49,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:49,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:54:49,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:49,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:54:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:49,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:54:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:49,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:54:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-11-22 23:54:49,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:54:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 1823 trivial. 0 not checked. [2018-11-22 23:54:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 23:54:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-22 23:54:49,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:54:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:54:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:54:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:54:49,968 INFO L87 Difference]: Start difference. First operand 3610 states and 4508 transitions. Second operand 3 states. [2018-11-22 23:54:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:50,016 INFO L93 Difference]: Finished difference Result 4045 states and 5016 transitions. [2018-11-22 23:54:50,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:54:50,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 516 [2018-11-22 23:54:50,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:50,023 INFO L225 Difference]: With dead ends: 4045 [2018-11-22 23:54:50,024 INFO L226 Difference]: Without dead ends: 3968 [2018-11-22 23:54:50,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1032 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:54:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2018-11-22 23:54:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3535. [2018-11-22 23:54:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3535 states. [2018-11-22 23:54:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 4415 transitions. [2018-11-22 23:54:50,080 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 4415 transitions. Word has length 516 [2018-11-22 23:54:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:50,080 INFO L480 AbstractCegarLoop]: Abstraction has 3535 states and 4415 transitions. [2018-11-22 23:54:50,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:54:50,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 4415 transitions. [2018-11-22 23:54:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-11-22 23:54:50,086 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:54:50,087 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:54:50,087 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:54:50,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:50,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1541123714, now seen corresponding path program 1 times [2018-11-22 23:54:50,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:54:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:50,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:50,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:54:50,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:54:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-22 23:54:50,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:50,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:54:50,286 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 629 with the following transitions: [2018-11-22 23:54:50,287 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [253], [261], [264], [269], [272], [274], [280], [283], [287], [289], [294], [297], [305], [307], [309], [312], [320], [325], [327], [330], [332], [337], [339], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2018-11-22 23:54:50,289 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:54:50,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:54:50,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:54:50,519 INFO L272 AbstractInterpreter]: Visited 116 different actions 340 times. Merged at 96 different actions 193 times. Never widened. Performed 1777 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1777 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 40 fixpoints after 18 different actions. Largest state had 106 variables. [2018-11-22 23:54:50,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:54:50,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:54:50,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:54:50,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:54:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:54:50,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:54:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:54:50,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:54:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-22 23:54:50,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:54:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4135 backedges. 2131 proven. 14 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2018-11-22 23:54:51,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:54:51,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-22 23:54:51,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:54:51,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 23:54:51,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 23:54:51,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:54:51,011 INFO L87 Difference]: Start difference. First operand 3535 states and 4415 transitions. Second operand 4 states. [2018-11-22 23:54:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:54:51,214 INFO L93 Difference]: Finished difference Result 4397 states and 5486 transitions. [2018-11-22 23:54:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:54:51,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 628 [2018-11-22 23:54:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:54:51,217 INFO L225 Difference]: With dead ends: 4397 [2018-11-22 23:54:51,217 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 23:54:51,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1261 GetRequests, 1256 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:54:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 23:54:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 23:54:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 23:54:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 23:54:51,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 628 [2018-11-22 23:54:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:54:51,223 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:54:51,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 23:54:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:54:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 23:54:51,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 23:54:51,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,832 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 102 [2018-11-22 23:54:51,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 23:54:51,990 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-11-22 23:54:52,376 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2018-11-22 23:54:52,955 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2018-11-22 23:54:52,987 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-22 23:54:52,987 INFO L451 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-22 23:54:52,987 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L444 ceAbstractionStarter]: At program point L169(lines 165 499) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-22 23:54:52,988 INFO L444 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-22 23:54:52,988 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L444 ceAbstractionStarter]: At program point L139(lines 135 509) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-22 23:54:52,989 INFO L444 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (<= ssl3_connect_~blastFlag~0 0)) [2018-11-22 23:54:52,989 INFO L448 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L444 ceAbstractionStarter]: At program point L175(lines 171 497) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L451 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-22 23:54:52,990 INFO L444 ceAbstractionStarter]: At program point L145(lines 141 507) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L444 ceAbstractionStarter]: At program point L181(lines 177 495) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-22 23:54:52,991 INFO L448 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L451 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L444 ceAbstractionStarter]: At program point L151(lines 147 505) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1))) [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-11-22 23:54:52,992 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L444 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-11-22 23:54:52,993 INFO L444 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-22 23:54:52,993 INFO L448 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L444 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse6 (= ssl3_connect_~s__state~0 4448)) (.cse10 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse13 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse14 (= ssl3_connect_~s__state~0 4464)) (.cse16 (= ssl3_connect_~s__state~0 4528)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse11 (<= ssl3_connect_~s__state~0 4352)) (.cse12 (<= 4352 ssl3_connect_~s__state~0)) (.cse17 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse7 (<= ssl3_connect_~blastFlag~0 2)) (.cse15 (= ssl3_connect_~s__state~0 4400))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse0 .cse1) (and .cse3 .cse6 .cse1) (and .cse7 .cse8 .cse9 .cse10) (and .cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11 .cse12 .cse10) (and .cse5 .cse0 .cse1) (and .cse13 .cse7 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse15 .cse0 .cse1) (and .cse7 .cse5) (and .cse3 .cse16 .cse1) (and .cse3 .cse8 .cse1 .cse9 .cse17) (and .cse13 .cse3) (and .cse3 .cse1 .cse2) (and .cse7 .cse16) (and .cse14 .cse3 .cse1) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse7 (= ssl3_connect_~s__state~0 4384)) (and (= ssl3_connect_~s__state~0 4416) .cse0 .cse1) (and .cse16 .cse0 .cse1) (< |ssl3_connect_#in~initial_state| 12292) (and .cse3 .cse11 .cse12 .cse1 .cse17) (and .cse4 .cse0 .cse1) (<= ssl3_connect_~blastFlag~0 0) (and .cse7 .cse15 .cse1)))) [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-22 23:54:52,994 INFO L444 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (< |ssl3_connect_#in~initial_state| 12292) [2018-11-22 23:54:52,994 INFO L448 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-22 23:54:52,995 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L444 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2018-11-22 23:54:52,996 INFO L444 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-22 23:54:52,996 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L444 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 (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2018-11-22 23:54:52,997 INFO L444 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4)) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2))) [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 76 551) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-22 23:54:52,997 INFO L451 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-22 23:54:52,997 INFO L444 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (< |ssl3_connect_#in~initial_state| 12292) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 .cse1))) [2018-11-22 23:54:52,997 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 23:54:52,998 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L444 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (<= 12292 main_~s~0) [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-22 23:54:52,998 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-22 23:54:53,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:54:53 BoogieIcfgContainer [2018-11-22 23:54:53,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:54:53,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:54:53,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:54:53,022 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:54:53,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:54:40" (3/4) ... [2018-11-22 23:54:53,026 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 23:54:53,031 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 23:54:53,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-22 23:54:53,032 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 23:54:53,040 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-22 23:54:53,040 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 23:54:53,041 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 23:54:53,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) [2018-11-22 23:54:53,067 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || blastFlag <= 0 [2018-11-22 23:54:53,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-22 23:54:53,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) [2018-11-22 23:54:53,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) [2018-11-22 23:54:53,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-22 23:54:53,068 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) [2018-11-22 23:54:53,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-22 23:54:53,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-22 23:54:53,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(initial_state) < 12292 [2018-11-22 23:54:53,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-22 23:54:53,069 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-22 23:54:53,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) [2018-11-22 23:54:53,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-22 23:54:53,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-11-22 23:54:53,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) [2018-11-22 23:54:53,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) [2018-11-22 23:54:53,119 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9e394bb6-9967-4be1-9a7e-8357a0623459/bin-2019/utaipan/witness.graphml [2018-11-22 23:54:53,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:54:53,119 INFO L168 Benchmark]: Toolchain (without parser) took 13791.67 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 961.1 MB in the beginning and 985.6 MB in the end (delta: -24.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,120 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:54:53,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.55 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 939.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,121 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,121 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,121 INFO L168 Benchmark]: RCFGBuilder took 521.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,121 INFO L168 Benchmark]: TraceAbstraction took 12850.62 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,122 INFO L168 Benchmark]: Witness Printer took 96.74 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 985.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:54:53,123 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.55 ms. Allocated memory is still 1.0 GB. Free memory was 961.1 MB in the beginning and 939.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 521.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12850.62 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 96.74 ms. Allocated memory is still 2.2 GB. Free memory was 1.0 GB in the beginning and 985.6 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. 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: ((\old(initial_state) < 12292 || (blastFlag <= 0 && 4560 <= s__state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || \old(initial_state) < 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || blastFlag <= 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((blastFlag <= 0 && s__state <= 4352) && 4352 <= s__state)) || ((((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__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: \old(initial_state) < 12292 || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || \old(initial_state) < 12292) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || blastFlag <= 0) || ((blastFlag <= 2 && s__state == 4400) && s__hit == 0) - 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: (\old(initial_state) < 12292 || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((\old(initial_state) < 12292 || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((4432 <= s__state && blastFlag <= 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 || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 138 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 26 OverallIterations, 22 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5408 SDtfs, 1932 SDslu, 3225 SDs, 0 SdLazy, 2605 SolverSat, 477 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4569 GetRequests, 4521 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8518occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 6109 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 774 HoareAnnotationTreeSize, 26 FomulaSimplifications, 20281 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2143 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 8697 NumberOfCodeBlocks, 8517 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 10903 ConstructedInterpolants, 0 QuantifiedInterpolants, 6362445 SizeOfPredicates, 9 NumberOfNonLiveVariables, 3762 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 36 InterpolantComputations, 25 PerfectInterpolantSequences, 49367/49478 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...