./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/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_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/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-1dbac8b [2018-10-26 23:18:32,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:18:32,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:18:32,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:18:32,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:18:32,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:18:32,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:18:32,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:18:32,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:18:32,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:18:32,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:18:32,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:18:32,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:18:32,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:18:32,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:18:32,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:18:32,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:18:32,927 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:18:32,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:18:32,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:18:32,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:18:32,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:18:32,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:18:32,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:18:32,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:18:32,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:18:32,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:18:32,936 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:18:32,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:18:32,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:18:32,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:18:32,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:18:32,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:18:32,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:18:32,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:18:32,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:18:32,942 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:18:32,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:18:32,952 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:18:32,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:18:32,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:18:32,954 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:18:32,955 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:18:32,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:18:32,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:18:32,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:18:32,956 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:18:32,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:18:32,959 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:18:32,959 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:18:32,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:18:32,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:18:32,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:18:32,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:18:32,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:18:32,960 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:18:32,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:18:32,960 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:18:32,960 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:18:32,960 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_691669c9-66fc-438d-9719-588b4a054c1a/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-10-26 23:18:32,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:18:32,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:18:33,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:18:33,008 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:18:33,008 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:18:33,008 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-10-26 23:18:33,057 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/data/4c7c2c070/adb7a40065ec4482b385e6e31322abfa/FLAG9ce0de0ac [2018-10-26 23:18:33,463 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:18:33,466 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-10-26 23:18:33,476 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/data/4c7c2c070/adb7a40065ec4482b385e6e31322abfa/FLAG9ce0de0ac [2018-10-26 23:18:33,491 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/data/4c7c2c070/adb7a40065ec4482b385e6e31322abfa [2018-10-26 23:18:33,494 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:18:33,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:18:33,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:18:33,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:18:33,498 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:18:33,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5db5b40a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33, skipping insertion in model container [2018-10-26 23:18:33,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:18:33,541 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:18:33,716 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:18:33,719 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:18:33,764 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:18:33,776 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:18:33,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33 WrapperNode [2018-10-26 23:18:33,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:18:33,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:18:33,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:18:33,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:18:33,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:18:33,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:18:33,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:18:33,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:18:33,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... [2018-10-26 23:18:33,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:18:33,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:18:33,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:18:33,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:18:33,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:18:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:18:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:18:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:18:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:18:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-10-26 23:18:33,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-10-26 23:18:33,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:18:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:18:34,210 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:18:34,210 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:18:34,866 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:18:34,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:34 BoogieIcfgContainer [2018-10-26 23:18:34,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:18:34,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:18:34,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:18:34,871 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:18:34,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:18:33" (1/3) ... [2018-10-26 23:18:34,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430b1302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:18:34, skipping insertion in model container [2018-10-26 23:18:34,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:18:33" (2/3) ... [2018-10-26 23:18:34,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430b1302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:18:34, skipping insertion in model container [2018-10-26 23:18:34,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:34" (3/3) ... [2018-10-26 23:18:34,875 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-10-26 23:18:34,887 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:18:34,899 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:18:34,913 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:18:34,951 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:18:34,952 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:18:34,952 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:18:34,952 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:18:34,952 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:18:34,952 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:18:34,952 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:18:34,952 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:18:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-26 23:18:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 23:18:34,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:34,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:34,988 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:34,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-10-26 23:18:34,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:35,042 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:18:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:35,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:35,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:35,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:35,224 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-10-26 23:18:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:35,389 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-10-26 23:18:35,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:35,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 23:18:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:35,402 INFO L225 Difference]: With dead ends: 380 [2018-10-26 23:18:35,403 INFO L226 Difference]: Without dead ends: 222 [2018-10-26 23:18:35,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-26 23:18:35,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-10-26 23:18:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-26 23:18:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-10-26 23:18:35,455 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-10-26 23:18:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:35,455 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-10-26 23:18:35,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-10-26 23:18:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:18:35,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:35,458 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:35,458 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:35,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:35,459 INFO L82 PathProgramCache]: Analyzing trace with hash 823204238, now seen corresponding path program 1 times [2018-10-26 23:18:35,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:35,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:18:35,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:35,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:35,540 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:35,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:35,542 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-10-26 23:18:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:35,985 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-10-26 23:18:35,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:35,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 23:18:35,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:35,987 INFO L225 Difference]: With dead ends: 476 [2018-10-26 23:18:35,987 INFO L226 Difference]: Without dead ends: 266 [2018-10-26 23:18:35,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-26 23:18:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-10-26 23:18:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-26 23:18:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-10-26 23:18:36,006 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-10-26 23:18:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:36,007 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-10-26 23:18:36,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-10-26 23:18:36,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 23:18:36,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:36,010 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:36,010 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:36,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:36,010 INFO L82 PathProgramCache]: Analyzing trace with hash 106611640, now seen corresponding path program 1 times [2018-10-26 23:18:36,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:36,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:18:36,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:36,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:36,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:36,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:36,104 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-10-26 23:18:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:36,264 INFO L93 Difference]: Finished difference Result 556 states and 817 transitions. [2018-10-26 23:18:36,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:36,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 23:18:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:36,267 INFO L225 Difference]: With dead ends: 556 [2018-10-26 23:18:36,267 INFO L226 Difference]: Without dead ends: 310 [2018-10-26 23:18:36,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-26 23:18:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2018-10-26 23:18:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-26 23:18:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2018-10-26 23:18:36,285 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 63 [2018-10-26 23:18:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:36,286 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2018-10-26 23:18:36,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2018-10-26 23:18:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 23:18:36,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:36,288 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:36,290 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:36,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 240625146, now seen corresponding path program 1 times [2018-10-26 23:18:36,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,291 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:36,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:18:36,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:36,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:36,430 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:36,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:36,432 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand 3 states. [2018-10-26 23:18:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:36,723 INFO L93 Difference]: Finished difference Result 690 states and 1014 transitions. [2018-10-26 23:18:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:36,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 23:18:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:36,726 INFO L225 Difference]: With dead ends: 690 [2018-10-26 23:18:36,727 INFO L226 Difference]: Without dead ends: 400 [2018-10-26 23:18:36,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-26 23:18:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2018-10-26 23:18:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-26 23:18:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-10-26 23:18:36,742 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-10-26 23:18:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:36,743 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-10-26 23:18:36,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-10-26 23:18:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 23:18:36,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:36,747 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:36,747 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:36,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1200385729, now seen corresponding path program 1 times [2018-10-26 23:18:36,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:36,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:36,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 23:18:36,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:36,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:36,835 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:36,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:36,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:36,836 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-10-26 23:18:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:37,019 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-10-26 23:18:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:37,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-10-26 23:18:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:37,029 INFO L225 Difference]: With dead ends: 860 [2018-10-26 23:18:37,029 INFO L226 Difference]: Without dead ends: 488 [2018-10-26 23:18:37,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-26 23:18:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-10-26 23:18:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-10-26 23:18:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-10-26 23:18:37,057 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-10-26 23:18:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:37,057 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-10-26 23:18:37,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-10-26 23:18:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 23:18:37,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:37,064 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:37,065 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:37,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash -415899658, now seen corresponding path program 1 times [2018-10-26 23:18:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:37,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:37,179 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 23:18:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:37,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:37,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:37,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:37,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,180 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-10-26 23:18:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:37,460 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-10-26 23:18:37,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:37,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-10-26 23:18:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:37,466 INFO L225 Difference]: With dead ends: 962 [2018-10-26 23:18:37,466 INFO L226 Difference]: Without dead ends: 512 [2018-10-26 23:18:37,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-26 23:18:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-10-26 23:18:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-26 23:18:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-10-26 23:18:37,488 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-10-26 23:18:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:37,488 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-10-26 23:18:37,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-10-26 23:18:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:18:37,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:37,491 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:37,491 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:37,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1478134315, now seen corresponding path program 1 times [2018-10-26 23:18:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,492 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:37,601 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:18:37,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:37,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:37,601 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:37,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:37,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,602 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-10-26 23:18:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:37,781 INFO L93 Difference]: Finished difference Result 1000 states and 1421 transitions. [2018-10-26 23:18:37,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:37,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-26 23:18:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:37,783 INFO L225 Difference]: With dead ends: 1000 [2018-10-26 23:18:37,784 INFO L226 Difference]: Without dead ends: 752 [2018-10-26 23:18:37,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-10-26 23:18:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2018-10-26 23:18:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-26 23:18:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1065 transitions. [2018-10-26 23:18:37,806 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1065 transitions. Word has length 102 [2018-10-26 23:18:37,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:37,807 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1065 transitions. [2018-10-26 23:18:37,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1065 transitions. [2018-10-26 23:18:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-26 23:18:37,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:37,811 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:18:37,811 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:37,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1650860735, now seen corresponding path program 1 times [2018-10-26 23:18:37,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:37,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:37,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:37,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-26 23:18:37,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:37,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:37,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:37,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:37,911 INFO L87 Difference]: Start difference. First operand 752 states and 1065 transitions. Second operand 3 states. [2018-10-26 23:18:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:38,274 INFO L93 Difference]: Finished difference Result 1000 states and 1418 transitions. [2018-10-26 23:18:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:38,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-10-26 23:18:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:38,278 INFO L225 Difference]: With dead ends: 1000 [2018-10-26 23:18:38,278 INFO L226 Difference]: Without dead ends: 998 [2018-10-26 23:18:38,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:38,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-10-26 23:18:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2018-10-26 23:18:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-10-26 23:18:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1416 transitions. [2018-10-26 23:18:38,300 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1416 transitions. Word has length 104 [2018-10-26 23:18:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:38,301 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1416 transitions. [2018-10-26 23:18:38,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1416 transitions. [2018-10-26 23:18:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-26 23:18:38,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:38,304 INFO L375 BasicCegarLoop]: trace histogram [9, 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-10-26 23:18:38,305 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:38,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1541275851, now seen corresponding path program 1 times [2018-10-26 23:18:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:38,307 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-10-26 23:18:38,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:38,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:38,419 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:38,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:38,420 INFO L87 Difference]: Start difference. First operand 998 states and 1416 transitions. Second operand 3 states. [2018-10-26 23:18:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:40,230 INFO L93 Difference]: Finished difference Result 2192 states and 3160 transitions. [2018-10-26 23:18:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:40,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-10-26 23:18:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:40,237 INFO L225 Difference]: With dead ends: 2192 [2018-10-26 23:18:40,238 INFO L226 Difference]: Without dead ends: 1198 [2018-10-26 23:18:40,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-10-26 23:18:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1158. [2018-10-26 23:18:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-10-26 23:18:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1660 transitions. [2018-10-26 23:18:40,268 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1660 transitions. Word has length 177 [2018-10-26 23:18:40,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:40,268 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1660 transitions. [2018-10-26 23:18:40,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1660 transitions. [2018-10-26 23:18:40,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-26 23:18:40,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:40,273 INFO L375 BasicCegarLoop]: trace histogram [10, 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-10-26 23:18:40,273 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:40,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:40,273 INFO L82 PathProgramCache]: Analyzing trace with hash 642373889, now seen corresponding path program 1 times [2018-10-26 23:18:40,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:40,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:40,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:40,276 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-10-26 23:18:40,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:40,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:40,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:40,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:40,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:40,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:40,422 INFO L87 Difference]: Start difference. First operand 1158 states and 1660 transitions. Second operand 3 states. [2018-10-26 23:18:40,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:40,533 INFO L93 Difference]: Finished difference Result 2414 states and 3438 transitions. [2018-10-26 23:18:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:40,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-10-26 23:18:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:40,541 INFO L225 Difference]: With dead ends: 2414 [2018-10-26 23:18:40,542 INFO L226 Difference]: Without dead ends: 1268 [2018-10-26 23:18:40,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-10-26 23:18:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1254. [2018-10-26 23:18:40,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-10-26 23:18:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-10-26 23:18:40,571 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1776 transitions. Word has length 214 [2018-10-26 23:18:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:40,572 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-10-26 23:18:40,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1776 transitions. [2018-10-26 23:18:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-26 23:18:40,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:40,577 INFO L375 BasicCegarLoop]: trace histogram [11, 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-10-26 23:18:40,577 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:40,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1976742319, now seen corresponding path program 1 times [2018-10-26 23:18:40,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:40,578 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-10-26 23:18:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:40,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:40,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:40,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:40,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:40,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:40,698 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. Second operand 3 states. [2018-10-26 23:18:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:40,983 INFO L93 Difference]: Finished difference Result 2612 states and 3688 transitions. [2018-10-26 23:18:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:40,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-26 23:18:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:40,990 INFO L225 Difference]: With dead ends: 2612 [2018-10-26 23:18:40,990 INFO L226 Difference]: Without dead ends: 1370 [2018-10-26 23:18:40,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:40,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-10-26 23:18:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1358. [2018-10-26 23:18:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-10-26 23:18:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1900 transitions. [2018-10-26 23:18:41,022 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1900 transitions. Word has length 236 [2018-10-26 23:18:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:41,022 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1900 transitions. [2018-10-26 23:18:41,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1900 transitions. [2018-10-26 23:18:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 23:18:41,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:41,027 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 23:18:41,028 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:41,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:41,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2113485127, now seen corresponding path program 1 times [2018-10-26 23:18:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:41,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:41,031 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-26 23:18:41,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:41,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:41,180 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:41,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:41,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:41,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:41,182 INFO L87 Difference]: Start difference. First operand 1358 states and 1900 transitions. Second operand 3 states. [2018-10-26 23:18:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:41,519 INFO L93 Difference]: Finished difference Result 2848 states and 3988 transitions. [2018-10-26 23:18:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:41,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 23:18:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:41,522 INFO L225 Difference]: With dead ends: 2848 [2018-10-26 23:18:41,523 INFO L226 Difference]: Without dead ends: 1502 [2018-10-26 23:18:41,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:41,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-26 23:18:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1490. [2018-10-26 23:18:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-10-26 23:18:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2052 transitions. [2018-10-26 23:18:41,556 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2052 transitions. Word has length 261 [2018-10-26 23:18:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:41,557 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 2052 transitions. [2018-10-26 23:18:41,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2052 transitions. [2018-10-26 23:18:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-26 23:18:41,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:41,564 INFO L375 BasicCegarLoop]: trace histogram [12, 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-10-26 23:18:41,564 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:41,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -564041719, now seen corresponding path program 1 times [2018-10-26 23:18:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:41,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:41,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:41,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:41,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-26 23:18:41,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:41,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:41,711 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:41,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:41,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:41,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:41,712 INFO L87 Difference]: Start difference. First operand 1490 states and 2052 transitions. Second operand 3 states. [2018-10-26 23:18:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:42,169 INFO L93 Difference]: Finished difference Result 3088 states and 4248 transitions. [2018-10-26 23:18:42,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:42,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-10-26 23:18:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:42,178 INFO L225 Difference]: With dead ends: 3088 [2018-10-26 23:18:42,178 INFO L226 Difference]: Without dead ends: 1610 [2018-10-26 23:18:42,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-10-26 23:18:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1602. [2018-10-26 23:18:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-10-26 23:18:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2184 transitions. [2018-10-26 23:18:42,212 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2184 transitions. Word has length 261 [2018-10-26 23:18:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:42,212 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 2184 transitions. [2018-10-26 23:18:42,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2184 transitions. [2018-10-26 23:18:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-26 23:18:42,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:42,218 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 23:18:42,219 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:42,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1603958306, now seen corresponding path program 1 times [2018-10-26 23:18:42,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:42,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:42,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-26 23:18:42,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:42,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:42,365 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:42,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:42,366 INFO L87 Difference]: Start difference. First operand 1602 states and 2184 transitions. Second operand 3 states. [2018-10-26 23:18:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:42,483 INFO L93 Difference]: Finished difference Result 4778 states and 6516 transitions. [2018-10-26 23:18:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:42,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-10-26 23:18:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:42,492 INFO L225 Difference]: With dead ends: 4778 [2018-10-26 23:18:42,492 INFO L226 Difference]: Without dead ends: 3188 [2018-10-26 23:18:42,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-10-26 23:18:42,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-10-26 23:18:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-10-26 23:18:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4343 transitions. [2018-10-26 23:18:42,544 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4343 transitions. Word has length 292 [2018-10-26 23:18:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:42,545 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 4343 transitions. [2018-10-26 23:18:42,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4343 transitions. [2018-10-26 23:18:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-26 23:18:42,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:42,553 INFO L375 BasicCegarLoop]: trace histogram [13, 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-10-26 23:18:42,553 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:42,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash -13482144, now seen corresponding path program 1 times [2018-10-26 23:18:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:42,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:42,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:42,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:42,554 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-10-26 23:18:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:42,706 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:42,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:42,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:42,707 INFO L87 Difference]: Start difference. First operand 3186 states and 4343 transitions. Second operand 3 states. [2018-10-26 23:18:43,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:43,157 INFO L93 Difference]: Finished difference Result 6668 states and 9122 transitions. [2018-10-26 23:18:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:43,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-10-26 23:18:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:43,171 INFO L225 Difference]: With dead ends: 6668 [2018-10-26 23:18:43,171 INFO L226 Difference]: Without dead ends: 3494 [2018-10-26 23:18:43,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-10-26 23:18:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3478. [2018-10-26 23:18:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3478 states. [2018-10-26 23:18:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4675 transitions. [2018-10-26 23:18:43,232 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4675 transitions. Word has length 292 [2018-10-26 23:18:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:43,233 INFO L481 AbstractCegarLoop]: Abstraction has 3478 states and 4675 transitions. [2018-10-26 23:18:43,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4675 transitions. [2018-10-26 23:18:43,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-26 23:18:43,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:43,241 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:18:43,241 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:43,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1438791767, now seen corresponding path program 1 times [2018-10-26 23:18:43,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:43,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:43,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:43,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:43,243 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-10-26 23:18:43,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:43,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:43,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:43,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:43,374 INFO L87 Difference]: Start difference. First operand 3478 states and 4675 transitions. Second operand 3 states. [2018-10-26 23:18:44,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:44,019 INFO L93 Difference]: Finished difference Result 7096 states and 9550 transitions. [2018-10-26 23:18:44,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:44,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-10-26 23:18:44,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:44,029 INFO L225 Difference]: With dead ends: 7096 [2018-10-26 23:18:44,030 INFO L226 Difference]: Without dead ends: 3630 [2018-10-26 23:18:44,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-10-26 23:18:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3614. [2018-10-26 23:18:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2018-10-26 23:18:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4831 transitions. [2018-10-26 23:18:44,130 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4831 transitions. Word has length 317 [2018-10-26 23:18:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:44,130 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 4831 transitions. [2018-10-26 23:18:44,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4831 transitions. [2018-10-26 23:18:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-26 23:18:44,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:44,139 INFO L375 BasicCegarLoop]: trace histogram [14, 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-10-26 23:18:44,139 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:44,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:44,140 INFO L82 PathProgramCache]: Analyzing trace with hash 516518699, now seen corresponding path program 1 times [2018-10-26 23:18:44,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:44,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:44,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-26 23:18:44,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:44,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:44,276 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:44,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:44,277 INFO L87 Difference]: Start difference. First operand 3614 states and 4831 transitions. Second operand 3 states. [2018-10-26 23:18:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:44,655 INFO L93 Difference]: Finished difference Result 7624 states and 10326 transitions. [2018-10-26 23:18:44,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:44,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-10-26 23:18:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:44,667 INFO L225 Difference]: With dead ends: 7624 [2018-10-26 23:18:44,667 INFO L226 Difference]: Without dead ends: 4022 [2018-10-26 23:18:44,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2018-10-26 23:18:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3934. [2018-10-26 23:18:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2018-10-26 23:18:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 5207 transitions. [2018-10-26 23:18:44,741 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 5207 transitions. Word has length 328 [2018-10-26 23:18:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:44,741 INFO L481 AbstractCegarLoop]: Abstraction has 3934 states and 5207 transitions. [2018-10-26 23:18:44,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 5207 transitions. [2018-10-26 23:18:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-26 23:18:44,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:44,749 INFO L375 BasicCegarLoop]: trace histogram [15, 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-10-26 23:18:44,749 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:44,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 654797532, now seen corresponding path program 1 times [2018-10-26 23:18:44,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:44,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-10-26 23:18:44,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:44,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:44,907 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:44,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:44,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:44,908 INFO L87 Difference]: Start difference. First operand 3934 states and 5207 transitions. Second operand 3 states. [2018-10-26 23:18:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:45,479 INFO L93 Difference]: Finished difference Result 8272 states and 10886 transitions. [2018-10-26 23:18:45,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:45,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2018-10-26 23:18:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:45,496 INFO L225 Difference]: With dead ends: 8272 [2018-10-26 23:18:45,501 INFO L226 Difference]: Without dead ends: 4350 [2018-10-26 23:18:45,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2018-10-26 23:18:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4062. [2018-10-26 23:18:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-10-26 23:18:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5359 transitions. [2018-10-26 23:18:45,575 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5359 transitions. Word has length 343 [2018-10-26 23:18:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:45,575 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 5359 transitions. [2018-10-26 23:18:45,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5359 transitions. [2018-10-26 23:18:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-26 23:18:45,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:45,583 INFO L375 BasicCegarLoop]: trace histogram [15, 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-10-26 23:18:45,583 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:45,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -929950053, now seen corresponding path program 1 times [2018-10-26 23:18:45,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:45,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-10-26 23:18:45,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:45,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:45,754 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:45,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:45,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:45,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:45,756 INFO L87 Difference]: Start difference. First operand 4062 states and 5359 transitions. Second operand 3 states. [2018-10-26 23:18:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:45,950 INFO L93 Difference]: Finished difference Result 11642 states and 15437 transitions. [2018-10-26 23:18:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:45,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-10-26 23:18:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:45,977 INFO L225 Difference]: With dead ends: 11642 [2018-10-26 23:18:45,978 INFO L226 Difference]: Without dead ends: 7592 [2018-10-26 23:18:45,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2018-10-26 23:18:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 7590. [2018-10-26 23:18:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-10-26 23:18:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 10069 transitions. [2018-10-26 23:18:46,090 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 10069 transitions. Word has length 344 [2018-10-26 23:18:46,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:46,091 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 10069 transitions. [2018-10-26 23:18:46,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 10069 transitions. [2018-10-26 23:18:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-26 23:18:46,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:46,100 INFO L375 BasicCegarLoop]: trace histogram [15, 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-10-26 23:18:46,100 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1917216481, now seen corresponding path program 1 times [2018-10-26 23:18:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:46,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:46,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:46,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-10-26 23:18:46,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:18:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:18:46,296 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:46,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:18:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:18:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:46,298 INFO L87 Difference]: Start difference. First operand 7590 states and 10069 transitions. Second operand 3 states. [2018-10-26 23:18:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:46,537 INFO L93 Difference]: Finished difference Result 15176 states and 20114 transitions. [2018-10-26 23:18:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:18:46,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2018-10-26 23:18:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:46,554 INFO L225 Difference]: With dead ends: 15176 [2018-10-26 23:18:46,554 INFO L226 Difference]: Without dead ends: 7598 [2018-10-26 23:18:46,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:18:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-10-26 23:18:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-10-26 23:18:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-10-26 23:18:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-10-26 23:18:46,676 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 345 [2018-10-26 23:18:46,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:46,676 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-10-26 23:18:46,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:18:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-10-26 23:18:46,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-26 23:18:46,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:46,685 INFO L375 BasicCegarLoop]: trace histogram [15, 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-10-26 23:18:46,685 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:46,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:46,686 INFO L82 PathProgramCache]: Analyzing trace with hash 560268956, now seen corresponding path program 1 times [2018-10-26 23:18:46,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:46,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:46,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:46,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1595 backedges. 936 proven. 11 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-10-26 23:18:46,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:46,898 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:18:46,899 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-10-26 23:18:46,900 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [249], [252], [254], [257], [265], [268], [273], [276], [278], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:18:46,941 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:18:46,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:18:47,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:18:47,917 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 103 variables. [2018-10-26 23:18:47,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:47,929 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:18:50,039 INFO L227 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 72.79% of their original sizes. [2018-10-26 23:18:50,039 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:18:51,627 INFO L415 sIntCurrentIteration]: We unified 367 AI predicates to 367 [2018-10-26 23:18:51,627 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:18:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:18:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-10-26 23:18:51,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:18:51,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:18:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:18:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:18:51,629 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 14 states. [2018-10-26 23:18:58,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:18:58,776 INFO L93 Difference]: Finished difference Result 15125 states and 19568 transitions. [2018-10-26 23:18:58,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:18:58,776 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 368 [2018-10-26 23:18:58,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:18:58,787 INFO L225 Difference]: With dead ends: 15125 [2018-10-26 23:18:58,788 INFO L226 Difference]: Without dead ends: 7571 [2018-10-26 23:18:58,796 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 369 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:18:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2018-10-26 23:18:58,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7570. [2018-10-26 23:18:58,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-10-26 23:18:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 9793 transitions. [2018-10-26 23:18:58,914 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 9793 transitions. Word has length 368 [2018-10-26 23:18:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:18:58,914 INFO L481 AbstractCegarLoop]: Abstraction has 7570 states and 9793 transitions. [2018-10-26 23:18:58,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:18:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 9793 transitions. [2018-10-26 23:18:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-26 23:18:58,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:18:58,924 INFO L375 BasicCegarLoop]: trace histogram [16, 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-10-26 23:18:58,925 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:18:58,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:18:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1266645793, now seen corresponding path program 1 times [2018-10-26 23:18:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:18:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:58,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:18:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:18:58,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:18:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:18:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-10-26 23:18:59,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:18:59,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:18:59,167 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 383 with the following transitions: [2018-10-26 23:18:59,168 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [257], [265], [268], [273], [276], [278], [284], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [424], [426], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:18:59,172 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:18:59,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:19:01,722 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:21:13,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:21:13,063 INFO L272 AbstractInterpreter]: Visited 113 different actions 4246 times. Merged at 103 different actions 3566 times. Widened at 25 different actions 482 times. Found 546 fixpoints after 44 different actions. Largest state had 105 variables. [2018-10-26 23:21:13,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:21:13,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:21:13,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:21:13,074 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:21:13,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:21:13,081 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:21:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:13,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:21:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-10-26 23:21:13,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:21:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-10-26 23:21:13,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:21:13,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:21:13,457 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:21:13,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:21:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:21:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:21:13,458 INFO L87 Difference]: Start difference. First operand 7570 states and 9793 transitions. Second operand 4 states. [2018-10-26 23:21:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:21:15,324 INFO L93 Difference]: Finished difference Result 15046 states and 19463 transitions. [2018-10-26 23:21:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:21:15,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2018-10-26 23:21:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:21:15,344 INFO L225 Difference]: With dead ends: 15046 [2018-10-26 23:21:15,344 INFO L226 Difference]: Without dead ends: 11348 [2018-10-26 23:21:15,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:21:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2018-10-26 23:21:15,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 8698. [2018-10-26 23:21:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8698 states. [2018-10-26 23:21:15,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 11313 transitions. [2018-10-26 23:21:15,551 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 11313 transitions. Word has length 382 [2018-10-26 23:21:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:21:15,552 INFO L481 AbstractCegarLoop]: Abstraction has 8698 states and 11313 transitions. [2018-10-26 23:21:15,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:21:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 11313 transitions. [2018-10-26 23:21:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-10-26 23:21:15,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:21:15,563 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:21:15,564 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:21:15,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:21:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash -158618308, now seen corresponding path program 2 times [2018-10-26 23:21:15,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:21:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:15,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:21:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:15,567 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:21:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:21:15,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:21:15,805 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:21:15,805 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 23:21:15,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 23:21:15,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:21:15,806 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:21:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 23:21:15,817 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:21:15,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-26 23:21:15,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 23:21:16,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:21:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:21:16,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:21:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-10-26 23:21:16,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:21:16,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:21:16,322 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:21:16,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:21:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:21:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:21:16,323 INFO L87 Difference]: Start difference. First operand 8698 states and 11313 transitions. Second operand 4 states. [2018-10-26 23:21:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:21:16,723 INFO L93 Difference]: Finished difference Result 19658 states and 25420 transitions. [2018-10-26 23:21:16,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:21:16,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-10-26 23:21:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:21:16,741 INFO L225 Difference]: With dead ends: 19658 [2018-10-26 23:21:16,741 INFO L226 Difference]: Without dead ends: 10968 [2018-10-26 23:21:16,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:21:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10968 states. [2018-10-26 23:21:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10968 to 8768. [2018-10-26 23:21:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8768 states. [2018-10-26 23:21:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 11136 transitions. [2018-10-26 23:21:16,919 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 11136 transitions. Word has length 396 [2018-10-26 23:21:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:21:16,920 INFO L481 AbstractCegarLoop]: Abstraction has 8768 states and 11136 transitions. [2018-10-26 23:21:16,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:21:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 11136 transitions. [2018-10-26 23:21:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-10-26 23:21:16,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:21:16,929 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:21:16,929 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:21:16,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:21:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash 960592567, now seen corresponding path program 1 times [2018-10-26 23:21:16,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:21:16,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:16,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 23:21:16,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:16,931 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:21:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-10-26 23:21:17,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:21:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:21:17,104 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:21:17,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:21:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:21:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:21:17,104 INFO L87 Difference]: Start difference. First operand 8768 states and 11136 transitions. Second operand 3 states. [2018-10-26 23:21:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:21:18,002 INFO L93 Difference]: Finished difference Result 16336 states and 20191 transitions. [2018-10-26 23:21:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:21:18,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-10-26 23:21:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:21:18,007 INFO L225 Difference]: With dead ends: 16336 [2018-10-26 23:21:18,007 INFO L226 Difference]: Without dead ends: 3930 [2018-10-26 23:21:18,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:21:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-10-26 23:21:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3713. [2018-10-26 23:21:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2018-10-26 23:21:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 4609 transitions. [2018-10-26 23:21:18,077 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 4609 transitions. Word has length 436 [2018-10-26 23:21:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:21:18,077 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 4609 transitions. [2018-10-26 23:21:18,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:21:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4609 transitions. [2018-10-26 23:21:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-10-26 23:21:18,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:21:18,083 INFO L375 BasicCegarLoop]: trace histogram [20, 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-10-26 23:21:18,083 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:21:18,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:21:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 922279106, now seen corresponding path program 1 times [2018-10-26 23:21:18,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:21:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:18,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:21:18,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:21:18,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:21:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:21:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1756 proven. 15 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2018-10-26 23:21:18,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:21:18,379 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:21:18,380 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 537 with the following transitions: [2018-10-26 23:21:18,381 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [257], [265], [268], [273], [276], [278], [284], [287], [289], [291], [293], [296], [298], [301], [309], [311], [313], [316], [318], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:21:18,384 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:21:18,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:21:21,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:23:54,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:23:54,097 INFO L272 AbstractInterpreter]: Visited 120 different actions 4752 times. Merged at 106 different actions 3933 times. Widened at 23 different actions 537 times. Found 675 fixpoints after 47 different actions. Largest state had 106 variables. [2018-10-26 23:23:54,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:54,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:23:54,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:54,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:23:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:54,117 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:23:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:54,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:23:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2018-10-26 23:23:54,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:23:54,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2018-10-26 23:23:54,577 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:54,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-10-26 23:23:54,577 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:54,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:23:54,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:23:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:23:54,578 INFO L87 Difference]: Start difference. First operand 3713 states and 4609 transitions. Second operand 3 states. [2018-10-26 23:23:54,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:54,609 INFO L93 Difference]: Finished difference Result 4161 states and 5130 transitions. [2018-10-26 23:23:54,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:23:54,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2018-10-26 23:23:54,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:54,616 INFO L225 Difference]: With dead ends: 4161 [2018-10-26 23:23:54,616 INFO L226 Difference]: Without dead ends: 4081 [2018-10-26 23:23:54,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1072 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:23:54,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2018-10-26 23:23:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 3635. [2018-10-26 23:23:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2018-10-26 23:23:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4513 transitions. [2018-10-26 23:23:54,674 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4513 transitions. Word has length 536 [2018-10-26 23:23:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:54,675 INFO L481 AbstractCegarLoop]: Abstraction has 3635 states and 4513 transitions. [2018-10-26 23:23:54,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:23:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4513 transitions. [2018-10-26 23:23:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-10-26 23:23:54,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:54,683 INFO L375 BasicCegarLoop]: trace histogram [22, 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-10-26 23:23:54,683 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:54,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:54,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1274124833, now seen corresponding path program 1 times [2018-10-26 23:23:54,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:54,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:54,684 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:54,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-10-26 23:23:55,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:55,035 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:55,035 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 651 with the following transitions: [2018-10-26 23:23:55,035 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [16], [27], [31], [37], [39], [42], [44], [49], [54], [59], [64], [67], [69], [74], [77], [79], [84], [87], [89], [94], [97], [99], [104], [107], [109], [114], [117], [119], [124], [129], [134], [139], [144], [147], [149], [154], [159], [164], [167], [169], [174], [177], [179], [184], [187], [189], [194], [197], [207], [209], [212], [216], [221], [236], [242], [247], [249], [252], [254], [257], [265], [268], [273], [276], [278], [284], [287], [291], [293], [298], [301], [309], [311], [313], [316], [324], [329], [331], [334], [336], [341], [343], [348], [353], [355], [364], [369], [374], [376], [385], [390], [393], [401], [406], [408], [413], [416], [421], [426], [428], [433], [436], [440], [442], [452], [454], [521], [523], [535], [538], [542], [543], [544], [546] [2018-10-26 23:23:55,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:55,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:57,401 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:25:53,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:25:53,422 INFO L272 AbstractInterpreter]: Visited 117 different actions 4030 times. Merged at 103 different actions 3421 times. Widened at 23 different actions 485 times. Found 476 fixpoints after 34 different actions. Largest state had 106 variables. [2018-10-26 23:25:53,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:25:53,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:25:53,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:25:53,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:25:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:25:53,436 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:25:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:25:53,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:25:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-10-26 23:25:53,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:25:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-10-26 23:25:53,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:25:53,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-10-26 23:25:53,902 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:25:53,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:25:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:25:53,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:25:53,903 INFO L87 Difference]: Start difference. First operand 3635 states and 4513 transitions. Second operand 4 states. [2018-10-26 23:25:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:25:54,054 INFO L93 Difference]: Finished difference Result 4520 states and 5607 transitions. [2018-10-26 23:25:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:25:54,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 650 [2018-10-26 23:25:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:25:54,055 INFO L225 Difference]: With dead ends: 4520 [2018-10-26 23:25:54,055 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:25:54,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:25:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:25:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:25:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:25:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:25:54,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 650 [2018-10-26 23:25:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:25:54,060 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:25:54,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:25:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:25:54,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:25:54,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:25:54,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,793 WARN L179 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 455 DAG size of output: 104 [2018-10-26 23:25:54,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:54,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:25:55,648 WARN L179 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-26 23:25:55,909 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2018-10-26 23:25:56,709 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2018-10-26 23:25:56,752 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 23:25:56,752 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 23:25:56,753 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-10-26 23:25:56,753 INFO L421 ceAbstractionStarter]: At program point L169(lines 165 499) 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 (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-10-26 23:25:56,753 INFO L421 ceAbstractionStarter]: At program point L103(lines 102 520) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4560 ssl3_connect_~s__state~0))) [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L421 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 (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse1))) [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-10-26 23:25:56,754 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L421 ceAbstractionStarter]: At program point L207(lines 105 519) the Hoare annotation is: (or (not (= |ssl3_connect_#in~initial_state| 12292)) (<= ssl3_connect_~blastFlag~0 0)) [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L421 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 (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-10-26 23:25:56,755 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L421 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 (= ssl3_connect_~s__hit~0 0)) (not (= |ssl3_connect_#in~initial_state| 12292)))) [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-10-26 23:25:56,756 INFO L421 ceAbstractionStarter]: At program point L181(lines 177 495) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2))) [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-10-26 23:25:56,757 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-10-26 23:25:56,758 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-10-26 23:25:56,758 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-10-26 23:25:56,758 INFO L421 ceAbstractionStarter]: At program point L151(lines 147 505) 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 (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2018-10-26 23:25:56,758 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L421 ceAbstractionStarter]: At program point L187(lines 183 493) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2018-10-26 23:25:56,759 INFO L421 ceAbstractionStarter]: At program point L121(lines 117 515) the Hoare annotation is: (or (not (= |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-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-10-26 23:25:56,759 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L421 ceAbstractionStarter]: At program point L486(lines 99 539) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0))) (let ((.cse1 (= ssl3_connect_~s__state~0 4400)) (.cse3 (= ssl3_connect_~s__state~0 4464)) (.cse5 (= ssl3_connect_~s__state~0 4448)) (.cse13 (not .cse2)) (.cse14 (<= ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ssl3_connect_~s__state~0)) (.cse6 (= ssl3_connect_~s__state~0 4528)) (.cse11 (<= 4560 ssl3_connect_~s__state~0)) (.cse12 (<= ssl3_connect_~s__state~0 4560)) (.cse16 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse10 (<= ssl3_connect_~s__state~0 3)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse4 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= ssl3_connect_~s__state~0 4480)) (.cse9 (= ssl3_connect_~s__state~0 4496)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse8 (= ssl3_connect_~s__state~0 4512))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse5 .cse4 .cse2) (and .cse6 .cse4 .cse2) (and .cse7 .cse1 .cse4 .cse2) (and .cse3 .cse7 .cse2) (and .cse0 (= ssl3_connect_~s__state~0 4384)) (and .cse0 .cse8) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse7 .cse5 .cse2) (and (= ssl3_connect_~s__state~0 4416) .cse4 .cse2) (and .cse8 .cse4 .cse2) (and .cse0 .cse6) (<= ssl3_connect_~blastFlag~0 0) (and (= ssl3_connect_~s__state~0 4432) .cse4 .cse2) (and .cse9 .cse4 .cse2) (and .cse10 .cse7) (and .cse0 .cse11 .cse12 .cse13) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse14 .cse15 .cse13) (and .cse7 .cse14 .cse15 .cse2 .cse16) (and .cse7 .cse2 .cse17) (and .cse7 .cse6 .cse2) (and .cse7 .cse11 .cse2 .cse12 .cse16) (and .cse10 .cse0 .cse2) (and .cse4 .cse2 .cse17) (and .cse7 .cse9 .cse2) (and .cse7 .cse8 .cse2)))) [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-10-26 23:25:56,760 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-10-26 23:25:56,761 INFO L421 ceAbstractionStarter]: At program point L193(lines 189 491) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0))) (or (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)) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0))) [2018-10-26 23:25:56,762 INFO L421 ceAbstractionStarter]: At program point L127(lines 123 513) the Hoare annotation is: (or (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560)) (not (= |ssl3_connect_#in~initial_state| 12292))) [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-10-26 23:25:56,762 INFO L421 ceAbstractionStarter]: At program point L196(lines 195 489) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)) (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))) [2018-10-26 23:25:56,762 INFO L421 ceAbstractionStarter]: At program point L163(lines 153 503) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 0) .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2018-10-26 23:25:56,762 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-10-26 23:25:56,763 INFO L421 ceAbstractionStarter]: At program point L133(lines 129 511) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (not (= |ssl3_connect_#in~initial_state| 12292)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0 .cse2))) [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (= main_~s~0 12292) [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-10-26 23:25:56,763 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-10-26 23:25:56,763 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-10-26 23:25:56,764 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-10-26 23:25:56,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:25:56 BoogieIcfgContainer [2018-10-26 23:25:56,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:25:56,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:25:56,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:25:56,825 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:25:56,826 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:18:34" (3/4) ... [2018-10-26 23:25:56,828 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:25:56,833 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:25:56,833 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-10-26 23:25:56,833 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:25:56,844 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-26 23:25:56,846 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-10-26 23:25:56,846 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 23:25:56,874 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) [2018-10-26 23:25:56,875 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || blastFlag <= 0 [2018-10-26 23:25:56,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:56,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-10-26 23:25:56,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:56,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-10-26 23:25:56,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((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__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((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 && blastFlag <= 2) && s__hit == 0)) || ((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) [2018-10-26 23:25:56,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) [2018-10-26 23:25:56,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:56,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-10-26 23:25:56,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) [2018-10-26 23:25:56,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:56,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) [2018-10-26 23:25:56,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) [2018-10-26 23:25:56,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) [2018-10-26 23:25:56,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((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))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) [2018-10-26 23:25:56,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(initial_state) == 12292) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((((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) [2018-10-26 23:25:56,950 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_691669c9-66fc-438d-9719-588b4a054c1a/bin-2019/utaipan/witness.graphml [2018-10-26 23:25:56,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:25:56,951 INFO L168 Benchmark]: Toolchain (without parser) took 443456.93 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -108.1 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,951 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:25:56,951 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 943.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,952 INFO L168 Benchmark]: Boogie Preprocessor took 96.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -214.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,952 INFO L168 Benchmark]: RCFGBuilder took 970.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,952 INFO L168 Benchmark]: TraceAbstraction took 441951.24 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.8 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:25:56,957 INFO L168 Benchmark]: Witness Printer took 125.35 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:25:56,959 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.7 MB in the beginning and 943.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.27 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 940.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 940.9 MB in the beginning and 1.2 GB in the end (delta: -214.7 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 970.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 441951.24 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.8 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 125.35 ms. Allocated memory is still 5.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 549]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((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))) || !(\old(initial_state) == 12292)) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (!(\old(initial_state) == 12292) || (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || ((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: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292) - 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) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((((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) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && s__hit == 0) && blastFlag <= 4) && s__state <= 4560) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 2 && s__state == 4400) && s__hit == 0) || ((s__state == 4464 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4448 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && s__state == 4400) && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4464 && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4384)) || (blastFlag <= 2 && s__state == 4512)) || !(\old(initial_state) == 12292)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4448) && s__hit == 0)) || ((s__state == 4416 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || blastFlag <= 0) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((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__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((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 && blastFlag <= 2) && s__hit == 0)) || ((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) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((4432 <= s__state && blastFlag <= 0) && s__state <= 4560) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0)) || !(\old(initial_state) == 12292) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560) || !(\old(initial_state) == 12292)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((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)) || !(\old(initial_state) == 12292)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0) || ((4432 <= s__state && blastFlag <= 0) && s__state <= 4560)) || !(\old(initial_state) == 12292)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 139 locations, 1 error locations. SAFE Result, 441.8s OverallTime, 26 OverallIterations, 22 TraceHistogramMax, 18.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5474 SDtfs, 1875 SDslu, 3504 SDs, 0 SdLazy, 2764 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4378 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8768occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 409.0s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.995132403904659 AbsIntWeakeningRatio, 0.4087193460490463 AbsIntAvgWeakeningVarsNumRemoved, 413.71117166212537 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 6112 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 26457 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3200 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 8707 NumberOfCodeBlocks, 8519 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 10637 ConstructedInterpolants, 0 QuantifiedInterpolants, 6597151 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3160 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 34 InterpolantComputations, 23 PerfectInterpolantSequences, 49625/49747 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...