./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_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/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_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/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-11-10 13:22:23,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:22:23,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:22:23,022 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:22:23,022 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:22:23,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:22:23,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:22:23,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:22:23,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:22:23,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:22:23,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:22:23,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:22:23,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:22:23,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:22:23,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:22:23,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:22:23,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:22:23,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:22:23,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:22:23,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:22:23,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:22:23,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:22:23,037 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:22:23,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:22:23,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:22:23,038 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:22:23,038 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:22:23,039 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:22:23,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:22:23,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:22:23,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:22:23,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:22:23,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:22:23,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:22:23,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:22:23,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:22:23,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:22:23,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:22:23,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:22:23,052 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:22:23,052 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:22:23,052 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:22:23,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:22:23,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:22:23,052 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:22:23,052 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:22:23,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:22:23,053 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:22:23,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:22:23,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:22:23,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:22:23,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:22:23,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:22:23,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:22:23,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:22:23,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:22:23,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:22:23,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:22:23,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:22:23,056 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_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1236ee922960b2737aa65707c3f9d27b28eaa4fc [2018-11-10 13:22:23,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:22:23,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:22:23,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:22:23,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:22:23,097 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:22:23,097 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 13:22:23,141 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/data/0793ef49a/b3b941a3d0d94b438dcee4ebe235973f/FLAG755b1c12d [2018-11-10 13:22:23,514 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:22:23,515 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/sv-benchmarks/c/ssh-simplified/s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 13:22:23,523 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/data/0793ef49a/b3b941a3d0d94b438dcee4ebe235973f/FLAG755b1c12d [2018-11-10 13:22:23,534 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/data/0793ef49a/b3b941a3d0d94b438dcee4ebe235973f [2018-11-10 13:22:23,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:22:23,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:22:23,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:22:23,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:22:23,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:22:23,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc89c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23, skipping insertion in model container [2018-11-10 13:22:23,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:22:23,581 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:22:23,741 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:22:23,744 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:22:23,777 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:22:23,785 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:22:23,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23 WrapperNode [2018-11-10 13:22:23,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:22:23,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:22:23,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:22:23,786 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:22:23,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:22:23,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:22:23,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:22:23,800 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:22:23,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... [2018-11-10 13:22:23,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:22:23,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:22:23,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:22:23,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:22:23,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:22:23,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:22:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:22:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:22:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:22:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-11-10 13:22:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-11-10 13:22:23,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:22:23,904 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:22:23,986 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 13:22:23,986 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 13:22:24,344 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:22:24,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:22:24 BoogieIcfgContainer [2018-11-10 13:22:24,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:22:24,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:22:24,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:22:24,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:22:24,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:22:23" (1/3) ... [2018-11-10 13:22:24,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbb51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:22:24, skipping insertion in model container [2018-11-10 13:22:24,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:22:23" (2/3) ... [2018-11-10 13:22:24,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdbb51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:22:24, skipping insertion in model container [2018-11-10 13:22:24,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:22:24" (3/3) ... [2018-11-10 13:22:24,349 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2_true-unreach-call_true-termination.cil.c [2018-11-10 13:22:24,355 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:22:24,360 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:22:24,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:22:24,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:22:24,393 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:22:24,393 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:22:24,393 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:22:24,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:22:24,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:22:24,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:22:24,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:22:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-11-10 13:22:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 13:22:24,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:24,416 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-11-10 13:22:24,417 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:24,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:24,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1681840524, now seen corresponding path program 1 times [2018-11-10 13:22:24,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:24,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:22:24,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:24,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:24,560 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:24,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:24,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:24,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:24,573 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-11-10 13:22:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:24,638 INFO L93 Difference]: Finished difference Result 380 states and 637 transitions. [2018-11-10 13:22:24,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:24,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 13:22:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:24,649 INFO L225 Difference]: With dead ends: 380 [2018-11-10 13:22:24,649 INFO L226 Difference]: Without dead ends: 222 [2018-11-10 13:22:24,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-10 13:22:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-10 13:22:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-10 13:22:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 328 transitions. [2018-11-10 13:22:24,684 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 328 transitions. Word has length 30 [2018-11-10 13:22:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:24,685 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 328 transitions. [2018-11-10 13:22:24,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 328 transitions. [2018-11-10 13:22:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 13:22:24,686 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:24,686 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-11-10 13:22:24,686 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:24,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 823204238, now seen corresponding path program 1 times [2018-11-10 13:22:24,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:22:24,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:24,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:24,750 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:24,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:24,752 INFO L87 Difference]: Start difference. First operand 222 states and 328 transitions. Second operand 3 states. [2018-11-10 13:22:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:24,889 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2018-11-10 13:22:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:24,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 13:22:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:24,892 INFO L225 Difference]: With dead ends: 476 [2018-11-10 13:22:24,892 INFO L226 Difference]: Without dead ends: 266 [2018-11-10 13:22:24,894 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-11-10 13:22:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-10 13:22:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 258. [2018-11-10 13:22:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-10 13:22:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 374 transitions. [2018-11-10 13:22:24,910 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 374 transitions. Word has length 45 [2018-11-10 13:22:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:24,911 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 374 transitions. [2018-11-10 13:22:24,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 374 transitions. [2018-11-10 13:22:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:22:24,913 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:24,913 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-11-10 13:22:24,913 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:24,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash 106611640, now seen corresponding path program 1 times [2018-11-10 13:22:24,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:24,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:24,914 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:22:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:24,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:24,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:24,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:24,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:24,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:24,978 INFO L87 Difference]: Start difference. First operand 258 states and 374 transitions. Second operand 3 states. [2018-11-10 13:22:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,070 INFO L93 Difference]: Finished difference Result 556 states and 817 transitions. [2018-11-10 13:22:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 13:22:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,072 INFO L225 Difference]: With dead ends: 556 [2018-11-10 13:22:25,072 INFO L226 Difference]: Without dead ends: 310 [2018-11-10 13:22:25,074 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-11-10 13:22:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-10 13:22:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2018-11-10 13:22:25,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-10 13:22:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2018-11-10 13:22:25,089 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 63 [2018-11-10 13:22:25,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,089 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2018-11-10 13:22:25,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2018-11-10 13:22:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:22:25,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,091 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-11-10 13:22:25,091 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 240625146, now seen corresponding path program 1 times [2018-11-10 13:22:25,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,092 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:22:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,147 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,148 INFO L87 Difference]: Start difference. First operand 300 states and 426 transitions. Second operand 3 states. [2018-11-10 13:22:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,299 INFO L93 Difference]: Finished difference Result 690 states and 1014 transitions. [2018-11-10 13:22:25,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-10 13:22:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,302 INFO L225 Difference]: With dead ends: 690 [2018-11-10 13:22:25,302 INFO L226 Difference]: Without dead ends: 400 [2018-11-10 13:22:25,303 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-11-10 13:22:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-11-10 13:22:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 382. [2018-11-10 13:22:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 13:22:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2018-11-10 13:22:25,316 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 63 [2018-11-10 13:22:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,317 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2018-11-10 13:22:25,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2018-11-10 13:22:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 13:22:25,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,319 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-11-10 13:22:25,319 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1200385729, now seen corresponding path program 1 times [2018-11-10 13:22:25,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:22:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,377 INFO L87 Difference]: Start difference. First operand 382 states and 526 transitions. Second operand 3 states. [2018-11-10 13:22:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,497 INFO L93 Difference]: Finished difference Result 860 states and 1222 transitions. [2018-11-10 13:22:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-10 13:22:25,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,499 INFO L225 Difference]: With dead ends: 860 [2018-11-10 13:22:25,499 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 13:22:25,500 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-11-10 13:22:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 13:22:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 462. [2018-11-10 13:22:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-10 13:22:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 662 transitions. [2018-11-10 13:22:25,514 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 662 transitions. Word has length 77 [2018-11-10 13:22:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,514 INFO L481 AbstractCegarLoop]: Abstraction has 462 states and 662 transitions. [2018-11-10 13:22:25,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 662 transitions. [2018-11-10 13:22:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 13:22:25,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,515 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-11-10 13:22:25,516 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash -415899658, now seen corresponding path program 1 times [2018-11-10 13:22:25,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,517 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 13:22:25,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,553 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,561 INFO L87 Difference]: Start difference. First operand 462 states and 662 transitions. Second operand 3 states. [2018-11-10 13:22:25,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,680 INFO L93 Difference]: Finished difference Result 962 states and 1387 transitions. [2018-11-10 13:22:25,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-10 13:22:25,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,683 INFO L225 Difference]: With dead ends: 962 [2018-11-10 13:22:25,683 INFO L226 Difference]: Without dead ends: 512 [2018-11-10 13:22:25,684 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-11-10 13:22:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-11-10 13:22:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2018-11-10 13:22:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-10 13:22:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2018-11-10 13:22:25,697 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 81 [2018-11-10 13:22:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,698 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2018-11-10 13:22:25,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2018-11-10 13:22:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 13:22:25,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,699 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-11-10 13:22:25,701 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1478134315, now seen corresponding path program 1 times [2018-11-10 13:22:25,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,702 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:22:25,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,771 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand 3 states. [2018-11-10 13:22:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,802 INFO L93 Difference]: Finished difference Result 1000 states and 1421 transitions. [2018-11-10 13:22:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-11-10 13:22:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,805 INFO L225 Difference]: With dead ends: 1000 [2018-11-10 13:22:25,805 INFO L226 Difference]: Without dead ends: 752 [2018-11-10 13:22:25,806 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-11-10 13:22:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-11-10 13:22:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2018-11-10 13:22:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-11-10 13:22:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1065 transitions. [2018-11-10 13:22:25,822 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1065 transitions. Word has length 102 [2018-11-10 13:22:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,822 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 1065 transitions. [2018-11-10 13:22:25,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1065 transitions. [2018-11-10 13:22:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 13:22:25,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,824 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-11-10 13:22:25,824 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1650860735, now seen corresponding path program 1 times [2018-11-10 13:22:25,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 13:22:25,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,860 INFO L87 Difference]: Start difference. First operand 752 states and 1065 transitions. Second operand 3 states. [2018-11-10 13:22:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:25,900 INFO L93 Difference]: Finished difference Result 1000 states and 1418 transitions. [2018-11-10 13:22:25,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:25,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-11-10 13:22:25,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:25,903 INFO L225 Difference]: With dead ends: 1000 [2018-11-10 13:22:25,904 INFO L226 Difference]: Without dead ends: 998 [2018-11-10 13:22:25,904 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-11-10 13:22:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-11-10 13:22:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2018-11-10 13:22:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-11-10 13:22:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1416 transitions. [2018-11-10 13:22:25,925 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1416 transitions. Word has length 104 [2018-11-10 13:22:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:25,925 INFO L481 AbstractCegarLoop]: Abstraction has 998 states and 1416 transitions. [2018-11-10 13:22:25,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1416 transitions. [2018-11-10 13:22:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:22:25,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:25,928 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-11-10 13:22:25,928 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1541275851, now seen corresponding path program 1 times [2018-11-10 13:22:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:25,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-10 13:22:25,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:25,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:25,995 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:25,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:25,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:25,995 INFO L87 Difference]: Start difference. First operand 998 states and 1416 transitions. Second operand 3 states. [2018-11-10 13:22:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:26,117 INFO L93 Difference]: Finished difference Result 2192 states and 3160 transitions. [2018-11-10 13:22:26,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:26,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-11-10 13:22:26,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:26,122 INFO L225 Difference]: With dead ends: 2192 [2018-11-10 13:22:26,122 INFO L226 Difference]: Without dead ends: 1198 [2018-11-10 13:22:26,124 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-11-10 13:22:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-11-10 13:22:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1158. [2018-11-10 13:22:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:22:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1660 transitions. [2018-11-10 13:22:26,149 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1660 transitions. Word has length 177 [2018-11-10 13:22:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:26,149 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1660 transitions. [2018-11-10 13:22:26,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:26,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1660 transitions. [2018-11-10 13:22:26,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 13:22:26,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:26,152 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-11-10 13:22:26,153 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:26,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 642373889, now seen corresponding path program 1 times [2018-11-10 13:22:26,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:26,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-11-10 13:22:26,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:26,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:26,205 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:26,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:26,206 INFO L87 Difference]: Start difference. First operand 1158 states and 1660 transitions. Second operand 3 states. [2018-11-10 13:22:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:26,326 INFO L93 Difference]: Finished difference Result 2414 states and 3438 transitions. [2018-11-10 13:22:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:26,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2018-11-10 13:22:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:26,330 INFO L225 Difference]: With dead ends: 2414 [2018-11-10 13:22:26,330 INFO L226 Difference]: Without dead ends: 1268 [2018-11-10 13:22:26,332 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-11-10 13:22:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2018-11-10 13:22:26,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1254. [2018-11-10 13:22:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-11-10 13:22:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1776 transitions. [2018-11-10 13:22:26,359 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1776 transitions. Word has length 214 [2018-11-10 13:22:26,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:26,360 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1776 transitions. [2018-11-10 13:22:26,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:26,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1776 transitions. [2018-11-10 13:22:26,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-11-10 13:22:26,363 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:26,363 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-11-10 13:22:26,363 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:26,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1976742319, now seen corresponding path program 1 times [2018-11-10 13:22:26,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:26,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:26,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,365 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 491 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-10 13:22:26,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:26,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:26,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:26,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:26,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:26,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:26,424 INFO L87 Difference]: Start difference. First operand 1254 states and 1776 transitions. Second operand 3 states. [2018-11-10 13:22:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:26,519 INFO L93 Difference]: Finished difference Result 2612 states and 3688 transitions. [2018-11-10 13:22:26,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:26,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-11-10 13:22:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:26,524 INFO L225 Difference]: With dead ends: 2612 [2018-11-10 13:22:26,524 INFO L226 Difference]: Without dead ends: 1370 [2018-11-10 13:22:26,526 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-11-10 13:22:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-10 13:22:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1358. [2018-11-10 13:22:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-11-10 13:22:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1900 transitions. [2018-11-10 13:22:26,554 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1900 transitions. Word has length 236 [2018-11-10 13:22:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:26,554 INFO L481 AbstractCegarLoop]: Abstraction has 1358 states and 1900 transitions. [2018-11-10 13:22:26,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1900 transitions. [2018-11-10 13:22:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 13:22:26,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:26,558 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-11-10 13:22:26,558 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:26,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:26,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2113485127, now seen corresponding path program 1 times [2018-11-10 13:22:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,560 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-10 13:22:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:26,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:26,623 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:26,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:26,624 INFO L87 Difference]: Start difference. First operand 1358 states and 1900 transitions. Second operand 3 states. [2018-11-10 13:22:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:26,734 INFO L93 Difference]: Finished difference Result 2848 states and 3988 transitions. [2018-11-10 13:22:26,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:26,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 13:22:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:26,739 INFO L225 Difference]: With dead ends: 2848 [2018-11-10 13:22:26,739 INFO L226 Difference]: Without dead ends: 1502 [2018-11-10 13:22:26,741 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-11-10 13:22:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-11-10 13:22:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1490. [2018-11-10 13:22:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-11-10 13:22:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2052 transitions. [2018-11-10 13:22:26,772 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2052 transitions. Word has length 261 [2018-11-10 13:22:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:26,773 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 2052 transitions. [2018-11-10 13:22:26,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2052 transitions. [2018-11-10 13:22:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 13:22:26,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:26,778 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-11-10 13:22:26,778 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:26,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash -564041719, now seen corresponding path program 1 times [2018-11-10 13:22:26,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:26,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:26,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:26,780 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:26,877 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-10 13:22:26,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:26,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:26,877 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:26,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:26,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:26,878 INFO L87 Difference]: Start difference. First operand 1490 states and 2052 transitions. Second operand 3 states. [2018-11-10 13:22:26,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:26,983 INFO L93 Difference]: Finished difference Result 3088 states and 4248 transitions. [2018-11-10 13:22:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:26,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2018-11-10 13:22:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:26,988 INFO L225 Difference]: With dead ends: 3088 [2018-11-10 13:22:26,988 INFO L226 Difference]: Without dead ends: 1610 [2018-11-10 13:22:26,990 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-11-10 13:22:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-11-10 13:22:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1602. [2018-11-10 13:22:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-11-10 13:22:27,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2184 transitions. [2018-11-10 13:22:27,020 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2184 transitions. Word has length 261 [2018-11-10 13:22:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:27,020 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 2184 transitions. [2018-11-10 13:22:27,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2184 transitions. [2018-11-10 13:22:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 13:22:27,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:27,025 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-11-10 13:22:27,025 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:27,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1603958306, now seen corresponding path program 1 times [2018-11-10 13:22:27,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:27,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,026 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-10 13:22:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:27,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:27,095 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:27,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:27,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:27,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:27,095 INFO L87 Difference]: Start difference. First operand 1602 states and 2184 transitions. Second operand 3 states. [2018-11-10 13:22:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:27,156 INFO L93 Difference]: Finished difference Result 4778 states and 6516 transitions. [2018-11-10 13:22:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:27,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-11-10 13:22:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:27,165 INFO L225 Difference]: With dead ends: 4778 [2018-11-10 13:22:27,165 INFO L226 Difference]: Without dead ends: 3188 [2018-11-10 13:22:27,168 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-11-10 13:22:27,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2018-11-10 13:22:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3186. [2018-11-10 13:22:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3186 states. [2018-11-10 13:22:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4343 transitions. [2018-11-10 13:22:27,224 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4343 transitions. Word has length 292 [2018-11-10 13:22:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:27,224 INFO L481 AbstractCegarLoop]: Abstraction has 3186 states and 4343 transitions. [2018-11-10 13:22:27,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4343 transitions. [2018-11-10 13:22:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-11-10 13:22:27,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:27,232 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-11-10 13:22:27,232 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:27,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -13482144, now seen corresponding path program 1 times [2018-11-10 13:22:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:27,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2018-11-10 13:22:27,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:27,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:27,335 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:27,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:27,336 INFO L87 Difference]: Start difference. First operand 3186 states and 4343 transitions. Second operand 3 states. [2018-11-10 13:22:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:27,486 INFO L93 Difference]: Finished difference Result 6668 states and 9122 transitions. [2018-11-10 13:22:27,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:27,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2018-11-10 13:22:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:27,496 INFO L225 Difference]: With dead ends: 6668 [2018-11-10 13:22:27,496 INFO L226 Difference]: Without dead ends: 3494 [2018-11-10 13:22:27,501 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-11-10 13:22:27,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2018-11-10 13:22:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3478. [2018-11-10 13:22:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3478 states. [2018-11-10 13:22:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4675 transitions. [2018-11-10 13:22:27,558 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4675 transitions. Word has length 292 [2018-11-10 13:22:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:27,559 INFO L481 AbstractCegarLoop]: Abstraction has 3478 states and 4675 transitions. [2018-11-10 13:22:27,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4675 transitions. [2018-11-10 13:22:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-11-10 13:22:27,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:27,566 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-11-10 13:22:27,566 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:27,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1438791767, now seen corresponding path program 1 times [2018-11-10 13:22:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:27,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2018-11-10 13:22:27,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:27,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:27,652 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:27,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:27,652 INFO L87 Difference]: Start difference. First operand 3478 states and 4675 transitions. Second operand 3 states. [2018-11-10 13:22:27,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:27,826 INFO L93 Difference]: Finished difference Result 7096 states and 9550 transitions. [2018-11-10 13:22:27,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:27,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2018-11-10 13:22:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:27,836 INFO L225 Difference]: With dead ends: 7096 [2018-11-10 13:22:27,836 INFO L226 Difference]: Without dead ends: 3630 [2018-11-10 13:22:27,841 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-11-10 13:22:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2018-11-10 13:22:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 3614. [2018-11-10 13:22:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2018-11-10 13:22:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 4831 transitions. [2018-11-10 13:22:27,914 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 4831 transitions. Word has length 317 [2018-11-10 13:22:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:27,914 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 4831 transitions. [2018-11-10 13:22:27,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 4831 transitions. [2018-11-10 13:22:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 13:22:27,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:27,921 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-11-10 13:22:27,921 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:27,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:27,922 INFO L82 PathProgramCache]: Analyzing trace with hash 516518699, now seen corresponding path program 1 times [2018-11-10 13:22:27,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:27,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:27,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:27,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-10 13:22:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:28,043 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:28,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:28,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:28,044 INFO L87 Difference]: Start difference. First operand 3614 states and 4831 transitions. Second operand 3 states. [2018-11-10 13:22:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:28,200 INFO L93 Difference]: Finished difference Result 7624 states and 10326 transitions. [2018-11-10 13:22:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:28,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2018-11-10 13:22:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:28,210 INFO L225 Difference]: With dead ends: 7624 [2018-11-10 13:22:28,210 INFO L226 Difference]: Without dead ends: 4022 [2018-11-10 13:22:28,215 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-11-10 13:22:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2018-11-10 13:22:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3934. [2018-11-10 13:22:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3934 states. [2018-11-10 13:22:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3934 states to 3934 states and 5207 transitions. [2018-11-10 13:22:28,272 INFO L78 Accepts]: Start accepts. Automaton has 3934 states and 5207 transitions. Word has length 328 [2018-11-10 13:22:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:28,273 INFO L481 AbstractCegarLoop]: Abstraction has 3934 states and 5207 transitions. [2018-11-10 13:22:28,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:28,273 INFO L276 IsEmpty]: Start isEmpty. Operand 3934 states and 5207 transitions. [2018-11-10 13:22:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-11-10 13:22:28,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:28,279 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-11-10 13:22:28,279 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:28,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 654797532, now seen corresponding path program 1 times [2018-11-10 13:22:28,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,280 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2018-11-10 13:22:28,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:28,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:28,357 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:28,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:28,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:28,358 INFO L87 Difference]: Start difference. First operand 3934 states and 5207 transitions. Second operand 3 states. [2018-11-10 13:22:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:28,484 INFO L93 Difference]: Finished difference Result 8272 states and 10886 transitions. [2018-11-10 13:22:28,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:28,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2018-11-10 13:22:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:28,495 INFO L225 Difference]: With dead ends: 8272 [2018-11-10 13:22:28,495 INFO L226 Difference]: Without dead ends: 4350 [2018-11-10 13:22:28,499 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-11-10 13:22:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2018-11-10 13:22:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4062. [2018-11-10 13:22:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2018-11-10 13:22:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 5359 transitions. [2018-11-10 13:22:28,538 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 5359 transitions. Word has length 343 [2018-11-10 13:22:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:28,538 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 5359 transitions. [2018-11-10 13:22:28,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 5359 transitions. [2018-11-10 13:22:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-11-10 13:22:28,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:28,543 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-11-10 13:22:28,543 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:28,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash -929950053, now seen corresponding path program 1 times [2018-11-10 13:22:28,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:28,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,544 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-10 13:22:28,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:28,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:28,636 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:28,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:28,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:28,637 INFO L87 Difference]: Start difference. First operand 4062 states and 5359 transitions. Second operand 3 states. [2018-11-10 13:22:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:28,690 INFO L93 Difference]: Finished difference Result 11642 states and 15437 transitions. [2018-11-10 13:22:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:28,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2018-11-10 13:22:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:28,701 INFO L225 Difference]: With dead ends: 11642 [2018-11-10 13:22:28,701 INFO L226 Difference]: Without dead ends: 7592 [2018-11-10 13:22:28,705 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-11-10 13:22:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7592 states. [2018-11-10 13:22:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7592 to 7590. [2018-11-10 13:22:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7590 states. [2018-11-10 13:22:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7590 states to 7590 states and 10069 transitions. [2018-11-10 13:22:28,774 INFO L78 Accepts]: Start accepts. Automaton has 7590 states and 10069 transitions. Word has length 344 [2018-11-10 13:22:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:28,774 INFO L481 AbstractCegarLoop]: Abstraction has 7590 states and 10069 transitions. [2018-11-10 13:22:28,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:28,774 INFO L276 IsEmpty]: Start isEmpty. Operand 7590 states and 10069 transitions. [2018-11-10 13:22:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-10 13:22:28,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:28,780 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-11-10 13:22:28,781 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:28,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1917216481, now seen corresponding path program 1 times [2018-11-10 13:22:28,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:28,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:28,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:28,782 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-11-10 13:22:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:22:28,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:22:28,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:28,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:22:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:22:28,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:22:28,840 INFO L87 Difference]: Start difference. First operand 7590 states and 10069 transitions. Second operand 3 states. [2018-11-10 13:22:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:28,972 INFO L93 Difference]: Finished difference Result 15176 states and 20114 transitions. [2018-11-10 13:22:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:22:28,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2018-11-10 13:22:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:28,983 INFO L225 Difference]: With dead ends: 15176 [2018-11-10 13:22:28,983 INFO L226 Difference]: Without dead ends: 7598 [2018-11-10 13:22:28,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-11-10 13:22:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7598 states. [2018-11-10 13:22:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7598 to 7566. [2018-11-10 13:22:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7566 states. [2018-11-10 13:22:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7566 states to 7566 states and 9789 transitions. [2018-11-10 13:22:29,081 INFO L78 Accepts]: Start accepts. Automaton has 7566 states and 9789 transitions. Word has length 345 [2018-11-10 13:22:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:29,082 INFO L481 AbstractCegarLoop]: Abstraction has 7566 states and 9789 transitions. [2018-11-10 13:22:29,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:22:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7566 states and 9789 transitions. [2018-11-10 13:22:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-11-10 13:22:29,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:29,088 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-11-10 13:22:29,088 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:29,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash 560268956, now seen corresponding path program 1 times [2018-11-10 13:22:29,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:29,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:29,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:29,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:29,090 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1595 backedges. 936 proven. 11 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-10 13:22:29,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:22:29,224 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:22:29,224 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2018-11-10 13:22:29,226 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-11-10 13:22:29,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:22:29,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:22:29,821 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:22:29,822 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 103 variables. [2018-11-10 13:22:29,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:29,829 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:22:31,505 INFO L227 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 72.79% of their original sizes. [2018-11-10 13:22:31,505 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:22:32,567 INFO L415 sIntCurrentIteration]: We unified 367 AI predicates to 367 [2018-11-10 13:22:32,567 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:22:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:22:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [4] total 16 [2018-11-10 13:22:32,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:22:32,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 13:22:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 13:22:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:22:32,570 INFO L87 Difference]: Start difference. First operand 7566 states and 9789 transitions. Second operand 14 states. [2018-11-10 13:22:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:22:36,103 INFO L93 Difference]: Finished difference Result 15125 states and 19568 transitions. [2018-11-10 13:22:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:22:36,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 368 [2018-11-10 13:22:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:22:36,112 INFO L225 Difference]: With dead ends: 15125 [2018-11-10 13:22:36,112 INFO L226 Difference]: Without dead ends: 7571 [2018-11-10 13:22:36,117 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 369 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-10 13:22:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2018-11-10 13:22:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7570. [2018-11-10 13:22:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7570 states. [2018-11-10 13:22:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 9793 transitions. [2018-11-10 13:22:36,194 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 9793 transitions. Word has length 368 [2018-11-10 13:22:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:22:36,194 INFO L481 AbstractCegarLoop]: Abstraction has 7570 states and 9793 transitions. [2018-11-10 13:22:36,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 13:22:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 9793 transitions. [2018-11-10 13:22:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-11-10 13:22:36,199 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:22:36,199 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-11-10 13:22:36,199 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:22:36,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:22:36,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1266645793, now seen corresponding path program 1 times [2018-11-10 13:22:36,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:22:36,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:36,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:22:36,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:22:36,201 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:22:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:22:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-10 13:22:36,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:22:36,278 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:22:36,278 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 383 with the following transitions: [2018-11-10 13:22:36,279 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-11-10 13:22:36,283 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:22:36,283 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:22:38,336 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:24:29,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:24:29,840 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-11-10 13:24:29,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:29,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:24:29,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:24:29,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:24:29,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:29,861 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:24:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:29,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:24:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-10 13:24:30,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:24:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 972 proven. 11 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-11-10 13:24:30,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:24:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 13:24:30,107 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:24:30,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:24:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:24:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:24:30,108 INFO L87 Difference]: Start difference. First operand 7570 states and 9793 transitions. Second operand 4 states. [2018-11-10 13:24:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:24:30,368 INFO L93 Difference]: Finished difference Result 15046 states and 19463 transitions. [2018-11-10 13:24:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:24:30,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2018-11-10 13:24:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:24:30,381 INFO L225 Difference]: With dead ends: 15046 [2018-11-10 13:24:30,381 INFO L226 Difference]: Without dead ends: 11348 [2018-11-10 13:24:30,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:24:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11348 states. [2018-11-10 13:24:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11348 to 8698. [2018-11-10 13:24:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8698 states. [2018-11-10 13:24:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 11313 transitions. [2018-11-10 13:24:30,510 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 11313 transitions. Word has length 382 [2018-11-10 13:24:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:24:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 8698 states and 11313 transitions. [2018-11-10 13:24:30,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:24:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 11313 transitions. [2018-11-10 13:24:30,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-10 13:24:30,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:30,518 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-11-10 13:24:30,518 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:30,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -158618308, now seen corresponding path program 2 times [2018-11-10 13:24:30,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:24:30,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:30,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:30,520 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:24:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:30,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 13:24:30,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:24:30,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:24:30,610 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:24:30,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:24:30,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:24:30,610 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:24:30,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:24:30,618 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:24:30,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-10 13:24:30,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:24:30,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:24:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 13:24:30,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:24:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1035 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-11-10 13:24:30,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:24:30,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 13:24:30,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:24:30,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:24:30,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:24:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:24:30,812 INFO L87 Difference]: Start difference. First operand 8698 states and 11313 transitions. Second operand 4 states. [2018-11-10 13:24:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:24:31,037 INFO L93 Difference]: Finished difference Result 19658 states and 25420 transitions. [2018-11-10 13:24:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:24:31,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-10 13:24:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:24:31,049 INFO L225 Difference]: With dead ends: 19658 [2018-11-10 13:24:31,049 INFO L226 Difference]: Without dead ends: 10968 [2018-11-10 13:24:31,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:24:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10968 states. [2018-11-10 13:24:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10968 to 8768. [2018-11-10 13:24:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8768 states. [2018-11-10 13:24:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 11136 transitions. [2018-11-10 13:24:31,180 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 11136 transitions. Word has length 396 [2018-11-10 13:24:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:24:31,181 INFO L481 AbstractCegarLoop]: Abstraction has 8768 states and 11136 transitions. [2018-11-10 13:24:31,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:24:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 11136 transitions. [2018-11-10 13:24:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-11-10 13:24:31,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:31,188 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-11-10 13:24:31,188 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:31,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:31,188 INFO L82 PathProgramCache]: Analyzing trace with hash 960592567, now seen corresponding path program 1 times [2018-11-10 13:24:31,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:24:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:31,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:24:31,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:31,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:24:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2123 backedges. 962 proven. 0 refuted. 0 times theorem prover too weak. 1161 trivial. 0 not checked. [2018-11-10 13:24:31,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:24:31,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:24:31,272 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:24:31,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:24:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:24:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:24:31,273 INFO L87 Difference]: Start difference. First operand 8768 states and 11136 transitions. Second operand 3 states. [2018-11-10 13:24:31,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:24:31,413 INFO L93 Difference]: Finished difference Result 16336 states and 20191 transitions. [2018-11-10 13:24:31,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:24:31,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 436 [2018-11-10 13:24:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:24:31,418 INFO L225 Difference]: With dead ends: 16336 [2018-11-10 13:24:31,418 INFO L226 Difference]: Without dead ends: 3930 [2018-11-10 13:24:31,428 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-11-10 13:24:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3930 states. [2018-11-10 13:24:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3930 to 3713. [2018-11-10 13:24:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3713 states. [2018-11-10 13:24:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3713 states to 3713 states and 4609 transitions. [2018-11-10 13:24:31,467 INFO L78 Accepts]: Start accepts. Automaton has 3713 states and 4609 transitions. Word has length 436 [2018-11-10 13:24:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:24:31,468 INFO L481 AbstractCegarLoop]: Abstraction has 3713 states and 4609 transitions. [2018-11-10 13:24:31,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:24:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3713 states and 4609 transitions. [2018-11-10 13:24:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2018-11-10 13:24:31,472 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:24:31,472 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-11-10 13:24:31,472 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:24:31,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:24:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 922279106, now seen corresponding path program 1 times [2018-11-10 13:24:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:24:31,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:31,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:24:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:24:31,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:24:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:24:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1756 proven. 15 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2018-11-10 13:24:31,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:24:31,581 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:24:31,581 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 537 with the following transitions: [2018-11-10 13:24:31,581 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-11-10 13:24:31,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:24:31,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:24:33,647 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:26:45,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:26:45,880 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-11-10 13:26:45,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:26:45,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:26:45,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:26:45,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:26:45,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:26:45,890 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:26:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:26:45,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:26:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2018-11-10 13:26:46,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:26:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 1168 proven. 0 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2018-11-10 13:26:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:26:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-11-10 13:26:46,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:26:46,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:26:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:26:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:26:46,301 INFO L87 Difference]: Start difference. First operand 3713 states and 4609 transitions. Second operand 3 states. [2018-11-10 13:26:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:26:46,358 INFO L93 Difference]: Finished difference Result 4161 states and 5130 transitions. [2018-11-10 13:26:46,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:26:46,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2018-11-10 13:26:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:26:46,366 INFO L225 Difference]: With dead ends: 4161 [2018-11-10 13:26:46,366 INFO L226 Difference]: Without dead ends: 4081 [2018-11-10 13:26:46,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1075 GetRequests, 1072 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:26:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2018-11-10 13:26:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 3635. [2018-11-10 13:26:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3635 states. [2018-11-10 13:26:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3635 states to 3635 states and 4513 transitions. [2018-11-10 13:26:46,424 INFO L78 Accepts]: Start accepts. Automaton has 3635 states and 4513 transitions. Word has length 536 [2018-11-10 13:26:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:26:46,424 INFO L481 AbstractCegarLoop]: Abstraction has 3635 states and 4513 transitions. [2018-11-10 13:26:46,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:26:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3635 states and 4513 transitions. [2018-11-10 13:26:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-11-10 13:26:46,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:26:46,431 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-11-10 13:26:46,431 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:26:46,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:26:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1274124833, now seen corresponding path program 1 times [2018-11-10 13:26:46,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:26:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:46,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:26:46,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:26:46,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:26:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:26:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-11-10 13:26:46,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:26:46,651 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:26:46,652 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 651 with the following transitions: [2018-11-10 13:26:46,652 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-11-10 13:26:46,655 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:26:46,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:26:48,526 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:28:31,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:28:31,841 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-11-10 13:28:31,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:28:31,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:28:31,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:28:31,843 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:28:31,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:28:31,848 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:28:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:28:31,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:28:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-11-10 13:28:32,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:28:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 2255 proven. 15 refuted. 0 times theorem prover too weak. 2096 trivial. 0 not checked. [2018-11-10 13:28:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:28:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-11-10 13:28:32,281 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:28:32,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:28:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:28:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:28:32,281 INFO L87 Difference]: Start difference. First operand 3635 states and 4513 transitions. Second operand 4 states. [2018-11-10 13:28:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:28:32,374 INFO L93 Difference]: Finished difference Result 4520 states and 5607 transitions. [2018-11-10 13:28:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:28:32,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 650 [2018-11-10 13:28:32,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:28:32,375 INFO L225 Difference]: With dead ends: 4520 [2018-11-10 13:28:32,375 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:28:32,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:28:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:28:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:28:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:28:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:28:32,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 650 [2018-11-10 13:28:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:28:32,380 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:28:32,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:28:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:28:32,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:28:32,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:28:32,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,825 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 455 DAG size of output: 104 [2018-11-10 13:28:32,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:32,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:28:33,772 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2018-11-10 13:28:33,808 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:28:33,809 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 335) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L428 ceAbstractionStarter]: At program point L201(lines 200 488) the Hoare annotation is: true [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L168(lines 168 498) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 509) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 520) no Hoare annotation was computed. [2018-11-10 13:28:33,809 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-11-10 13:28:33,809 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-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2018-11-10 13:28:33,809 INFO L425 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L435(lines 435 439) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L435-2(lines 435 439) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L336(lines 336 340) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L336-2(lines 336 340) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L270-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 497) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 508) no Hoare annotation was computed. [2018-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 519) no Hoare annotation was computed. [2018-11-10 13:28:33,810 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-11-10 13:28:33,810 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 307) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 242) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L305-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 374) no Hoare annotation was computed. [2018-11-10 13:28:33,811 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-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L174(lines 174 496) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L141(lines 141 507) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 518) no Hoare annotation was computed. [2018-11-10 13:28:33,811 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-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 475) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L425 ceAbstractionStarter]: For program point L473-2(lines 473 475) no Hoare annotation was computed. [2018-11-10 13:28:33,811 INFO L428 ceAbstractionStarter]: At program point L540(lines 98 541) the Hoare annotation is: true [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L276-2(lines 276 280) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L177(lines 177 495) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 506) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L111(lines 111 517) no Hoare annotation was computed. [2018-11-10 13:28:33,812 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-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 214) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L212-2(lines 212 214) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L180(lines 180 494) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 505) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 516) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 480) no Hoare annotation was computed. [2018-11-10 13:28:33,812 INFO L425 ceAbstractionStarter]: For program point L445(lines 445 456) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L412(lines 412 426) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 412 426) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L445-2(lines 445 456) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L313(lines 313 316) no Hoare annotation was computed. [2018-11-10 13:28:33,813 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-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 547) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 547) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 350) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 493) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 504) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L117(lines 117 515) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L428 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 552) the Hoare annotation is: true [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 13:28:33,813 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 220) no Hoare annotation was computed. [2018-11-10 13:28:33,813 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-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 91) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L416(lines 416 422) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 257) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 453) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 492) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L153(lines 153 503) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 514) no Hoare annotation was computed. [2018-11-10 13:28:33,814 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-11-10 13:28:33,814 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-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L88(lines 88 90) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L88-2(lines 85 91) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point $Ultimate##85(lines 202 487) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point $Ultimate##84(lines 202 487) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 297) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L287-2(lines 287 297) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L254-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 13:28:33,814 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-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L321(lines 321 323) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 491) no Hoare annotation was computed. [2018-11-10 13:28:33,814 INFO L425 ceAbstractionStarter]: For program point L156(lines 156 502) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 513) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 392) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L421 ceAbstractionStarter]: At program point L322(lines 76 551) the Hoare annotation is: (not (= |ssl3_connect_#in~initial_state| 12292)) [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L388-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 234) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L223-2(lines 202 485) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 537) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 552) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L522(lines 522 536) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 359) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 293) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 228) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L291-2(lines 289 297) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 490) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 501) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 512) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L93(lines 93 97) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 552) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 528) no Hoare annotation was computed. [2018-11-10 13:28:33,815 INFO L425 ceAbstractionStarter]: For program point L523-2(lines 522 536) no Hoare annotation was computed. [2018-11-10 13:28:33,815 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-11-10 13:28:33,815 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-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 96) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 489) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 500) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 511) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 366) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L361-2(lines 361 366) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 232) no Hoare annotation was computed. [2018-11-10 13:28:33,816 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-11-10 13:28:33,816 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-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L461-1(lines 461 463) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 265) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 488) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 499) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 510) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 539) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L99-2(lines 76 551) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 400) no Hoare annotation was computed. [2018-11-10 13:28:33,816 INFO L428 ceAbstractionStarter]: At program point L199(lines 198 488) the Hoare annotation is: true [2018-11-10 13:28:33,816 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-11-10 13:28:33,816 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 13:28:33,817 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 534) no Hoare annotation was computed. [2018-11-10 13:28:33,817 INFO L421 ceAbstractionStarter]: At program point L559(line 559) the Hoare annotation is: (= main_~s~0 12292) [2018-11-10 13:28:33,817 INFO L425 ceAbstractionStarter]: For program point L559-1(line 559) no Hoare annotation was computed. [2018-11-10 13:28:33,817 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 553 563) the Hoare annotation is: true [2018-11-10 13:28:33,817 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 553 563) no Hoare annotation was computed. [2018-11-10 13:28:33,817 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 553 563) no Hoare annotation was computed. [2018-11-10 13:28:33,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:28:33 BoogieIcfgContainer [2018-11-10 13:28:33,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:28:33,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:28:33,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:28:33,838 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:28:33,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:22:24" (3/4) ... [2018-11-10 13:28:33,841 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:28:33,846 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:28:33,846 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ssl3_connect [2018-11-10 13:28:33,847 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:28:33,854 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-10 13:28:33,854 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-10 13:28:33,855 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 13:28:33,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || (blastFlag <= 0 && 4560 <= s__state) [2018-11-10 13:28:33,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || blastFlag <= 0 [2018-11-10 13:28:33,880 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) [2018-11-10 13:28:33,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) || !(\old(initial_state) == 12292) [2018-11-10 13:28:33,881 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-11-10 13:28:33,881 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-11-10 13:28:33,881 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-11-10 13:28:33,881 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-11-10 13:28:33,882 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-11-10 13:28:33,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(\old(initial_state) == 12292) [2018-11-10 13:28:33,882 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-11-10 13:28:33,882 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-11-10 13:28:33,882 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-11-10 13:28:33,882 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-11-10 13:28:33,883 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-11-10 13:28:33,883 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-11-10 13:28:33,883 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-11-10 13:28:33,931 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bd637c0e-44fa-4e33-88e2-5e068373e5b7/bin-2019/utaipan/witness.graphml [2018-11-10 13:28:33,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:28:33,931 INFO L168 Benchmark]: Toolchain (without parser) took 370394.23 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 963.0 MB in the beginning and 628.2 MB in the end (delta: 334.8 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,932 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:28:33,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.71 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 940.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,933 INFO L168 Benchmark]: Boogie Preprocessor took 68.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,933 INFO L168 Benchmark]: RCFGBuilder took 475.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,933 INFO L168 Benchmark]: TraceAbstraction took 369492.79 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 628.2 MB in the end (delta: 458.5 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-11-10 13:28:33,933 INFO L168 Benchmark]: Witness Printer took 93.38 ms. Allocated memory is still 5.1 GB. Free memory is still 628.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:28:33,934 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.71 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 945.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.25 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 940.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 475.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.7 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 369492.79 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 628.2 MB in the end (delta: 458.5 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 93.38 ms. Allocated memory is still 5.1 GB. Free memory is still 628.2 MB. 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, 369.4s OverallTime, 26 OverallIterations, 22 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 5474 SDtfs, 1875 SDslu, 3504 SDs, 0 SdLazy, 2764 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 4378 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.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, 353.6s AbstIntTime, 4 AbstIntIterations, 1 AbstIntStrong, 0.995132403904659 AbsIntWeakeningRatio, 0.4087193460490463 AbsIntAvgWeakeningVarsNumRemoved, 413.71117166212537 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 6112 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 264 NumberOfFragments, 773 HoareAnnotationTreeSize, 26 FomulaSimplifications, 26457 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3200 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.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...